426 search results - page 50 / 86 » Combining Answer Sets of Nonmonotonic Logic Programs |
LPNMR
2007
Springer
14 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...
ACL
2012
11 years 10 months ago
2012
Most information extraction (IE) systems identify facts that are explicitly stated in text. However, in natural language, some facts are implicit, and identifying them requires â€...
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. ...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Open Answer Set Programming (OASP) is an attractive framework for integrating ontologies and rules. In general OASP is undecidable. In previous work we provided a tableau-based alg...