3470 search results - page 50 / 694 » Head-Elementary-Set-Free Logic Programs |
116
click to vote
FUIN
2006
15 years 3 months ago
2006
We prove that negative hyper-resolution using any liftable and well-founded ordering refinement is a sound and complete procedure for answering queries in disjunctive logic program...
111
click to vote
ICLP
1995
Springer
15 years 6 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...
182
click to vote
JELIA
2010
Springer
15 years 1 months ago
2010
Springer
In this paper, we show that Reiter’s default logic in the propositional case can be translated into answer set programming by identifying the internal relationships among formula...
123
click to vote
ESWA
2006
15 years 3 months ago
2006
The paper demonstrates the efficient use of hybrid intelligent systems for solving the classification problem of bankruptcy. The aim of the study is to obtain classification schem...
168
click to vote
CL
1999
Springer
15 years 2 months ago
1999
Springer
Van Emden's incremental queries address the inadequacy of current Prolog-style querying mechanism in most logic programming systems for interactive problem-solving. In the co...