352 search results - page 30 / 71 » Paraconsistent Declarative Semantics for Extended Logic Prog... |
165
Voted
ICLP
2003
Springer
15 years 8 months ago
2003
Springer
In recent research on nonmonotonic logic programming, repeatedly strong equivalence of logic programs P and Q has been considered, which holds if the programs P ∪ R and Q ∪ R h...
117
Voted
TABLEAUX
1997
Springer
15 years 7 months ago
1997
Springer
We present a Prolog program that implements a sound and complete theorem prover for first-order intuitionistic logic. It is based on free-variable semantic tableaux extended by an...
131
click to vote
LPNMR
2007
Springer
15 years 9 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...
FSTTCS
2007
Springer
15 years 9 months ago
2007
Springer
There are two somewhat contradictory ways of looking at modules in a given programming language. On the one hand, module systems are largely independent of the particulars of progr...
150
click to vote
ICLP
2010
Springer
15 years 1 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...