4617 search results - page 819 / 924 » Automation of Diagrammatic Reasoning |
181
click to vote
LPNMR
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We consider the problem of whether a given preferred answer set program can be reduced to a propositional formula. Research on this topic is of both theoretical and pract...
169
click to vote
LPNMR
2009
Springer
16 years 1 months ago
2009
Springer
We define the semantics of logic programs with (abstract) constraint atoms in a way closely tied to default logic. Like default logic, formulas in rules are evaluated using the cl...
168
click to vote
LPNMR
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. The logic FO(ID) uses ideas from the field of logic programming to extend first order logic with non-monotone inductive definitions. The goal of this paper is to exten...
196
click to vote
LPNMR
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. In answer-set programming (ASP), many notions of program equivalence have been introduced and formally analysed. A particular line of research in this direction aims at s...
151
click to vote
LPNMR
2009
Springer
16 years 1 months ago
2009
Springer
Modular nonmonotonic logic programs (MLPs) under the answer-set semantics have been recently introduced as an ASP formalism in which modules can receive context-dependent input fro...