1313 search results - page 59 / 263 » Prioritized Reasoning in Logic Programming |
154
Voted
LOPSTR
2000
Springer
15 years 7 months ago
2000
Springer
In this paper we will present a formal framework, based on the notion of extraction calculus, which has been successfully applied to define procedures for extracting information fr...
128
Voted
ICLP
2001
Springer
15 years 8 months ago
2001
Springer
In the paper we establish the xed-parameter complexity for several parameterized decision problems involving models, supported models and stable models of logic programs. We also e...
112
Voted
FM
2009
Springer
15 years 10 months ago
2009
Springer
Verification methods for memory-manipulating C programs need to address not only well-typed programs that respect invariants such as the split heap memory model, but also programs...
150
click to vote
LPAR
1994
Springer
15 years 7 months ago
1994
Springer
In this paper we develop a generic declarative diagnoser for normal logic programs that is based on tree search. The soundness and the completeness of the diagnoser are proved. The...
127
Voted
AMAI
2005
Springer
15 years 3 months ago
2005
Springer
Using the ideas from current investigations in Knowledge Representation we study the use of a class of logic programs for reasoning about infinite sets. Our programs reason about t...