40 search results - page 3 / 8 » Compressing Propositional Refutations |
AAAI
1997
14 years 11 months ago
1997
In this paper, we present a novel first order theorem proving strategy - ordered semantic hyper linking. Ordered semantic hyper linking (OSHL) is an instance-based refutational th...
91
Voted
CADE
1999
Springer
15 years 1 months ago
1999
Springer
We present a PSpace algorithm that decides satisfiability of the graded modal logic Gr(KR)—a natural extension of propositional modal logic KR by counting expressions—which pl...
88
Voted
APAL
2008
14 years 9 months ago
2008
We develop and study the complexity of propositional proof systems of varying strength extending resolution by allowing it to operate with disjunctions of linear equations instead ...
CADE
2011
Springer
13 years 9 months ago
2011
Springer
This paper describes two algorithms for the compression of propositional resolution proofs. The first algorithm, RecyclePivotsWithIntersection, performs partial regularization, re...
64
Voted
EUROCAST
2007
Springer
15 years 3 months ago
2007
Springer
