977 search results - page 47 / 196 » Logic programming with infinite sets |
134
Voted
LANMR
2004
15 years 1 months ago
2004
In previous work we have discussed the importance of identifying the cycles that occur in a logic program under the answer set semantics, and the connections between cycles, that w...
120
Voted
DKE
2010
15 years 15 days ago
2010
We describe the Consistency Extractor System (ConsEx) that computes consistent answers to Datalog queries with negation posed to relational databases that may be inconsistent with...
108
click to vote
AAAI
2008
15 years 2 months ago
2008
One way to solve the knowledge acquisition bottleneck is to have ways to translate natural language sentences and discourses to a formal knowledge representation language, especia...
94
Voted
LPNMR
1999
Springer
15 years 4 months ago
1999
Springer
We introduce choice logic programs as negation-free datalog programs that allow rules to have exclusive-only (possibly empty) disjunctions in the head. Such programs naturally mod...
131
click to vote
CORR
2002
Springer
15 years 7 days 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...