Sciweavers

193 search results - page 4 / 39
» Dynamical Properties of Answer Set Programs
Sort
View
AGP
2003
IEEE
15 years 3 months ago
Transforming co-NP Checks to Answer Set Computation by Meta-Interpretation
Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and check” nature ...
Thomas Eiter, Axel Polleres
FOIKS
2006
Springer
15 years 1 months ago
Guarded Open Answer Set Programming with Generalized Literals
Abstract. We extend the open answer set semantics for programs with generalized literals. Such extended programs (EPs) have interesting properties, e.g. the ability to express infi...
Stijn Heymans, Davy Van Nieuwenborgh, Dirk Vermeir
99
Voted
ICLP
2010
Springer
15 years 2 months ago
Dynamic Magic Sets for Disjunctive Datalog Programs
Abstract. Answer set programming (ASP) is a powerful formalism for knowledge representation and common sense reasoning that allows disjunction in rule heads and nonmonotonic negati...
Mario Alviano
86
Voted
ICLP
2010
Springer
15 years 2 months ago
Efficient Solving of Time-dependent Answer Set Programs
Answer set programs with time predicates are useful to model systems whose properties depend on time, like for example gene regulatory networks. A state of such a system at time po...
Timur Fayruzov, Jeroen Janssen, Dirk Vermeir, Chri...
90
Voted
FOIKS
2004
Springer
15 years 3 months ago
Implementing Ordered Choice Logic Programming using Answer Set Solvers
Abstract. Ordered Choice Logic Programming (OCLP) allows for dynamic preference-based decision-making with multiple alternatives without the need for any form of negation. This com...
Marina De Vos