175 search results - page 9 / 35 » Implementing Ordered Choice Logic Programming using Answer S... |
153
click to vote
ICLP
2009
Springer
15 years 10 months ago
2009
Springer
The paper describes a novel methodology to compute stable models in Answer Set Programming. The proposed approach relies on a bottom-up computation that does not require a prelimin...
114
Voted
DEXAW
2003
IEEE
15 years 2 months ago
2003
IEEE
We integrate ontology languages and logic programming (LP) by extending disjunctive logic programs (DLPs) and their semantics in order to support inverses and an infinite univers...
88
Voted
LPNMR
2007
Springer
15 years 3 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...
108
Voted
CORR
2002
Springer
14 years 9 months ago
2002
Springer
A relational database is inconsistent if it does not satisfy a given set of integrity constraints. Nevertheless, it is likely that most of the data in it is consistent with the co...
102
Voted
JELIA
2010
Springer
14 years 7 months ago
2010
Springer
Tabled Logic Programming (TLP) is becoming widely available in Prolog systems, but most implementations of TLP implement only answer variance in which an answer A is added to the t...