227 search results - page 11 / 46 » A Model Theory for Paraconsistent Logic Programming |
POPL
2010
ACM
15 years 9 months ago
2010
ACM
The method of logical relations is a classic technique for proving the equivalence of higher-order programs that implement the same observable behavior but employ different intern...
84
Voted
APLAS
2005
ACM
15 years 5 months ago
2005
ACM
We describe a sound method for automatically proving Hoare triples for loop-free code in Separation Logic, for certain preconditions and postconditions (symbolic heaps). The method...
118
click to vote
AGP
2010
IEEE
15 years 4 months ago
2010
IEEE
We review the Italian contribution to proof-theoretic and higher-order extensions of logic programming; this originated from the realization that Horn clauses lacked standard abstr...
91
Voted
AAAI
2004
15 years 1 months ago
2004
We propose and study extensions of logic programming with constraints represented as generalized atoms of the form C(X), where X is a finite set of atoms and C is act constraint (...
ESWS
2007
Springer
15 years 5 months ago
2007
Springer
In this paper we propose an approach to semantic matchmaking that exploits various knowledge representation technologies to find most promising partners in peer-to-peer e-marketpl...