Sciweavers

3090 search results - page 53 / 618
» On Testing Answer-Set Programs
Sort
View
CORR
2004
Springer
124views Education» more  CORR 2004»
13 years 9 months ago
On the existence of stable models of non-stratified logic programs
In this paper we analyze the relationship between cyclic definitions and consistency in GelfondLifschitz's answer sets semantics (initially defined as `stable model semantics...
Stefania Costantini
AAAI
2004
13 years 11 months ago
Loop Formulas for Circumscription
Clark's completion is a simple nonmonotonic formalism and a special case of several nonmonotonic logics. Recently there has been work on extending completion with "loop ...
Joohyung Lee, Fangzhen Lin
JELIA
2010
Springer
13 years 8 months ago
The mcs-ie System for Explaining Inconsistency in Multi-Context Systems
The Multi-Context System Inconsistency Explainer allows for evaluation of semantics and explanation of inconsistencies in systems where heterogeneous knowledge bases are linked via...
Markus Bögl, Thomas Eiter, Michael Fink, Pete...
ICLP
2009
Springer
14 years 10 months ago
One More Decidable Class of Finitely Ground Programs
When a logic program is processed by an answer set solver, the first task is to generate its instantiation. In a recent paper, Calimeri et el. made the idea of efficient instantiat...
Yuliya Lierler, Vladimir Lifschitz
AMAI
2006
Springer
13 years 10 months ago
Strong order equivalence
Abstract. Recently, notions of equivalence for Answer Set Programming have been studied intensively and were shown to be beneficial for modular programming and automated optimizati...
Wolfgang Faber, Kathrin Konczak