Sciweavers

175 search results - page 11 / 35
» Implementing Ordered Choice Logic Programming using Answer S...
Sort
View
AICOM
2006
129views more  AICOM 2006»
14 years 9 months ago
A backjumping technique for Disjunctive Logic Programming
In this work we present a backjumping technique for Disjunctive Logic Programming (DLP) under the Answer Set Semantics. It builds upon related techniques that had originally been p...
Francesco Ricca, Wolfgang Faber, Nicola Leone
ENTCS
2008
150views more  ENTCS 2008»
14 years 9 months ago
Analyzing Security Scenarios Using Defence Trees and Answer Set Programming
Defence trees are used to represent attack and defence strategies in security scenarios; the aim in such scenarios is to select the best set of countermeasures that are able to st...
Stefano Bistarelli, Pamela Peretti, Irina Trubitsy...
LPNMR
2007
Springer
15 years 3 months ago
Using Answer Sets to Solve Belief Change Problems
We describe BE, an implemented system for solving belief change problems in the presence of actions. We illustrate how we can use BE to compute the result of belief progression, be...
Aaron Hunter, James P. Delgrande, Joel Faber
PTS
2010
175views Hardware» more  PTS 2010»
14 years 7 months ago
Test Data Generation for Programs with Quantified First-Order Logic Specifications
We present a novel algorithm for test data generation that is based on techniques used in formal software verification. Prominent examples of such formal techniques are symbolic ex...
Christoph Gladisch
IJCAI
2007
14 years 11 months ago
A New Perspective on Stable Models
The definition of a stable model has provided a declarative semantics for Prolog programs with negation as failure and has led to the development of answer set programming. In th...
Paolo Ferraris, Joohyung Lee, Vladimir Lifschitz