4617 search results - page 711 / 924 » Automation of Diagrammatic Reasoning |
166
click to vote
LPNMR
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. Most complete answer set solvers are based on DPLL. One of the constraint propagation methods is the so-called lookahead, which has been somewhat controversial, due to it...
206
click to vote
LPNMR
2007
Springer
16 years 1 months ago
2007
Springer
We describe BE, an implemented system for solving belief change problems in the presence of actions. We illustrate how we can use BE to compute the result of belief progression, be...
204
click to vote
LPNMR
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. We present a framework for updating logic programs under the answer-set semantics that builds on existing work on preferences in logic programming. The approach is simple...
190
click to vote
LPNMR
2007
Springer
16 years 1 months ago
2007
Springer
Practically all programming languages used in software engineering allow to split a program into several modules. For fully declarative and nonmonotonic logic programming languages...
201
click to vote
LPNMR
2007
Springer
16 years 1 months ago
2007
Springer
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...