1313 search results - page 77 / 263 » Prioritized Reasoning in Logic Programming |
107
click to vote
FOIKS
2006
Springer
15 years 1 months ago
2006
Springer
It is claimed in [45] that first-order theorem provers are not efficient for reasoning with ontologies based on description logics compared to specialised description logic reasone...
WFLP
2000
Springer
15 years 1 months ago
2000
Springer
We introduce a framework for assessing the effectiveness of partial evaluators in functional logic languages. Our framework is based on properties of the rewrite system that models...
168
click to vote
ICLP
2009
Springer
15 years 10 months ago
2009
Springer
This paper considers a semantic approach for merging logic programs under answer set semantics. Given logic programs P1, . . . , Pn, the goal is to provide characterisations of the...
LPNMR
2005
Springer
15 years 3 months ago
2005
Springer
We investigate techniques for approximating answer sets of general logic programs of Lifschitz and Woo, whose rules have single literals as heads. We propose three different method...
ESOP
2004
Springer
15 years 3 months ago
2004
Springer
t) Peter W. O’Hearn Queen Mary, University of London In the 1960s Dijkstra suggested that, in order to limit the complexity of potential process interactions, concurrent programs...