7167 search results - page 66 / 1434 » Answer Set Programming |
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...
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...
DEXA
1994
Springer
13 years 12 months ago
1994
Springer
We describe a functional database language OR-SML for handling disjunctive information in database queries, and its implementation on top of Standard ML 12]. The core language has ...
ESWS
2009
Springer
14 years 2 months ago
2009
Springer
Open Answer Set Programming (OASP) is an attractive framework for integrating ontologies and rules. Although several decidable fragments of OASP have been identified, few reasonin...
AAAI
2004
13 years 9 months ago
2004
Clark's completion is a simple nonmonotonic formalism and a special case of several nonmonotonic logics. Recently there has been work on extending completion with "loop ...