3776 search results - page 348 / 756 » Partition-Based Logical Reasoning |
127
click to vote
CADE
2000
Springer
15 years 9 months ago
2000
Springer
Abstract. This article introduces two techniques to improve the propagation efficiency of CSP based finite model generation methods. One approach consists in statically rewriting ...
137
click to vote
CADE
1999
Springer
15 years 9 months ago
1999
Springer
CutRes is a system which takes as input an LK-proof with arbitrary cuts and skolemized end-sequent and gives as output an LKproof with atomic cuts only. The elimination of cuts is ...
139
click to vote
LPNMR
1997
Springer
15 years 9 months ago
1997
Springer
We present a bottom-up algorithm for the computation of the well-founded model of non-disjunctive logic programs which is based on the set of elementary program transformations stu...
114
click to vote
CADE
1994
Springer
15 years 9 months ago
1994
Springer
We present a completion-based method for handling a new version of E-unification, called "mixed" E-unification, that is a combination of the classical "universal&quo...
135
click to vote
CADE
1992
Springer
15 years 9 months ago
1992
Springer
Theorem provers based on model elimination have exhibited extremely high inference rates but have lacked a redundancy control mechanism such as subsumption. In this paper we repor...