4513 search results - page 34 / 903 » Logic programming with satisfiability |
EPIA
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. Multi-adjoint logic program generalise monotonic logic programs introduced in [1] in that simultaneous use of several implications in the rules and rather general connect...
CORR
2002
Springer
14 years 10 months ago
2002
Springer
We introduce a methodology and framework for expressing general preference information in logic programming under the answer set semantics. An ordered logic program is an extended...
ENTCS
2008
14 years 10 months ago
2008
The satisfiability problem is the fundamental problem in proving the conflict-freeness of specifications, or in finding a counterexample for an invalid statement. In this paper, w...
112
click to vote
TACAS
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. We extend the setting of Satisfiability Modulo Theories (SMT) by introducing a theory of costs C, where it is possible to model and reason about resource consumption and ...
119
click to vote
RR
2009
Springer
15 years 2 months ago
2009
Springer
In this paper we argue the case for integrating the distinctive functionalities of logic programs and production systems within an abductive logic programming agent framework. In t...