308 search results - page 29 / 62 » Answer Set Programming Based on Propositional Satisfiability |
EDBT
2002
ACM
14 years 7 months ago
2002
ACM
Abstract. Estimating the sizes of query results, and intermediate results, is crucial to many aspects of query processing. In particular, it is necessary for effective query optimi...
CORR
1998
Springer
13 years 7 months ago
1998
Springer
In this paper we reexamine the place and role of stable model semantics in logic programming and contrast it with a least Herbrand model approach to Horn programs. We demonstrate ...
TABLEAUX
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. The clause linking technique of Lee and Plaisted proves the unsatisfiability of a set of first-order clauses by generating a sufficiently large set of instances of thes...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
Abstract. This paper introduces a propositional encoding for lexicographic path orders in connection with dependency pairs. This facilitates the application of SAT solvers for term...
DALT
2006
Springer
13 years 11 months ago
2006
Springer
Goals are used to define the behavior of (pro-active) agents. It is our view that the goals of an agent can be seen as a knowledge base of the situations that it wants to achieve. ...