443 search results - page 59 / 89 » SAT-Based Answer Set Programming |
IJCAI
1997
13 years 9 months ago
1997
We propose a method of compiling circumscription into Extended Logic Programs which is widely applicable to a class of parallel circumscription as well as a class of prioritized c...
EUROPAR
2004
Springer
14 years 1 months ago
2004
Springer
Tabling is an implementation technique that improves the declarativeness and expressiveness of Prolog by reusing answers to subgoals. The declarative nature of tabled logic program...
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. ...
RR
2009
Springer
14 years 2 months ago
2009
Springer
Open Answer Set Programming (OASP) can be seen as a framework to represent tightly integrated combined knowledge bases of ontologies and rules that are not necessarily DL-safe. The...
LPNMR
2007
Springer
14 years 2 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...