507 search results - page 83 / 102 » Automating first-order relational logic |
TIME
2005
IEEE
14 years 4 months ago
2005
IEEE
Information often comes from different sources and merging these sources usually leads to the apparition of inconsistencies. Fusion is the operation which consists in restoring th...
ASP
2005
Springer
14 years 4 months ago
2005
Springer
Answer Set Programming (ASP) and propositional satisfiability (SAT) are closely related. In some recent work we have shown that, on a wide set of logic programs called “tight”...
LPNMR
2005
Springer
14 years 4 months ago
2005
Springer
We introduce a declarative approach for a coherent composition of autonomous databases. For this we use ID-logic, a formalism that extends classical logic with inductive definitio...
CADE
2004
Springer
14 years 4 months ago
2004
Springer
The paper presents a modular superposition calculus for the combination of first-order theories involving both total and partial functions. Modularity means that inferences are pu...
ICLP
2003
Springer
14 years 4 months ago
2003
Springer
Logic programming is based on the idea that computation is controlled inference. The Extended Andorra Model provides a very powerful framework that supports both co-routining and p...