1151 search results - page 42 / 231 » Collaborative Programming: Applications of Logic and Automat... |
ICLP
1995
Springer
15 years 3 months ago
1995
Springer
The purpose of this paper is to study the problem of complete type inferencing for polymorphic order-sorted logic programs. We show that previous approaches are incomplete even if...
TPHOL
1999
IEEE
15 years 4 months ago
1999
IEEE
Combining theorem proving and model checking o ers the tantalizing possibility of e ciently reasoning about large circuits at high levels of abstraction. We have constructed a syst...
113
click to vote
LOPSTR
2000
Springer
15 years 3 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...
ICLP
2001
Springer
15 years 4 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...
116
click to vote
LPAR
1994
Springer
15 years 3 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...