Sciweavers

460 search results - page 4 / 92
» Revised Stable Models - A Semantics for Logic Programs
Sort
View
ICLP
2001
Springer
14 years 6 days ago
Fixed-Parameter Complexity of Semantics for Logic Programs
In the paper we establish the xed-parameter complexity for several parameterized decision problems involving models, supported models and stable models of logic programs. We also e...
Zbigniew Lonc, Miroslaw Truszczynski
JAIR
2012
211views Hardware» more  JAIR 2012»
11 years 10 months ago
Reformulating the Situation Calculus and the Event Calculus in the General Theory of Stable Models and in Answer Set Programming
Circumscription and logic programs under the stable model semantics are two wellknown nonmonotonic formalisms. The former has served as a basis of classical logic based action for...
Joohyung Lee, Ravi Palla
LPNMR
2007
Springer
14 years 1 months ago
Yet Another Proof of the Strong Equivalence Between Propositional Theories and Logic Programs
Recently, the stable model semantics was extended to the syntax of arbitrary propositional formulas, which are beyond the traditional rule form. Cabalar and Ferraris, as well as Ca...
Joohyung Lee, Ravi Palla
IBERAMIA
2004
Springer
14 years 1 months ago
Well Founded Semantics for Logic Program Updates
Over the last years various semantics have been proposed for dealing with updates of logic programs by (other) logic programs. Most of these semantics extend the stable models sema...
Federico Banti, José Júlio Alferes, ...
ASP
2003
Springer
14 years 1 months ago
Eliminating Disjunction from Propositional Logic Programs under Stable Model Preservation
Abstract. In general, disjunction is considered to add expressive power to propositional logic programs under stable model semantics, and to enlarge the range of problems which can...
Thomas Eiter, Michael Fink, Hans Tompits, Stefan W...