193 search results - page 29 / 39 » On the Progression Semantics and Boundedness of Answer Set P... |
ICLP
2003
Springer
15 years 2 months ago
2003
Springer
We equip ordered logic programs with negation as failure, using a simple generalization of the preferred answer set semantics for ordered programs. This extension supports a conven...
AICOM
2006
14 years 9 months ago
2006
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...
OTM
2005
Springer
15 years 2 months ago
2005
Springer
Several applications require reasoning over autonomously developed ontologies. Initially conceived to explicit the semantics of a certain domain, these ontologies become a powerfu...
127
Voted
CSL
2007
Springer
15 years 3 months ago
2007
Springer
Programs and Abstract Complexity A. Beckmann University of Wales Swansea Swansea, UK Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being ï...
100
Voted
JELIA
2010
Springer
14 years 8 months ago
2010
Springer
In previous work, the so-called Temporal Equilibrium Logic (TEL) was introduced. This formalism provides an extension of the Answer Set semantics for logic programs to arbirary the...