76 search results - page 1 / 16 » A Tabulation Proof Procedure for Residuated Logic Programmin... |
ECAI
2004
Springer
13 years 10 months ago
2004
Springer
CSL
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. We prove "untyping" theorems: in some typed theories (semirings, Kleene algebras, residuated lattices, involutive residuated lattices), typed equations can be d...
JELIA
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. We introduce a new proof procedure for abductive logic programming and present two soundness results. Our procedure extends that of Fung and Kowalski by integrating abduc...
FUIN
2006
13 years 4 months ago
2006
We prove that negative hyper-resolution using any liftable and well-founded ordering refinement is a sound and complete procedure for answering queries in disjunctive logic program...
ICLP
2010
Springer
13 years 3 months ago
2010
Springer
Abductive Logic Programming is a computationally founded representation of abductive reasoning. In most ALP frameworks, integrity constraints express domainspecific logical relati...