Sciweavers

193 search results - page 8 / 39
» On the Progression Semantics and Boundedness of Answer Set P...
Sort
View
JAIR
2012
211views Hardware» more  JAIR 2012»
12 years 12 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
2005
Springer
15 years 2 months ago
Guarded Open Answer Set Programming
Open answer set programming (OASP) is an extension of answer set programming where one may ground a program with an arbitrary superset of the program’s constants. We define a ...
Stijn Heymans, Davy Van Nieuwenborgh, Dirk Vermeir
AMAI
2006
Springer
14 years 9 months ago
Possibilistic uncertainty handling for answer set programming
In this work, we introduce a new framework able to deal with a reasoning that is at the same time non monotonic and uncertain. In order to take into account a certainty level assoc...
Pascal Nicolas, Laurent Garcia, Igor Stépha...
AUSAI
2006
Springer
15 years 1 months ago
LPForget: A System of Forgetting in Answer Set Programming
Abstract. A novel declarative approach of forgetting in answer set programming (ASP) has been proposed recently. In this paper we report a system prototype of forgetting in ASP, ca...
Fu-Leung Cheng, Thomas Eiter, Nathan Robinson, Abd...
100
Voted
JELIA
2010
Springer
14 years 7 months ago
Translating First-Order Causal Theories into Answer Set Programming
Abstract. Nonmonotonic causal logic became a basis for the semantics of several expressive action languages. Norman McCain and Paolo Ferraris showed how to embed propositional caus...
Vladimir Lifschitz, Fangkai Yang