45 search results - page 7 / 9 » Elimination of Self-Resolving Clauses |
ICLP
1987
Springer
13 years 11 months ago
1987
Springer
The Near-Horn Prolog procedures have been proposed as e ective procedures in the area of disjunctive logic programming, an extension of logic programming to the ( rstorder) non-Ho...
LICS
1999
IEEE
13 years 12 months ago
1999
IEEE
We give a new decision procedure for the guarded fragment with equality. The procedure is based on resolution with superposition. We argue that this method will be more useful in ...
ASPDAC
2005
ACM
13 years 9 months ago
2005
ACM
－ It is a hotly research topic to eliminate irrelevant variables from counterexample, to make it easier to be understood. BFL algorithm is the most effective Counterexample minim...
NGC
1998
Springer
13 years 7 months ago
1998
Springer
Reducing redundancy in search has been a major concern for automated deduction. Subgoal-reduction strategies, such as those based on model elimination and implemented in Prolog te...
DAM
1999
13 years 7 months ago
1999
An algorithm called Modoc", which has been introduced elsewhere, enhances propositional model elimination with autarky pruning, and other features. The model elimination meth...