34 search results - page 5 / 7 » Substitutions into propositional tautologies |
135
click to vote
SAT
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. In this paper we define a class of truth-value assignments, called bounded assignments, using a certain substitutional property. We show that every satisfiable Boolean ...
185
click to vote
CADE
2005
Springer
16 years 5 months ago
2005
Springer
We describe the design and implementation of a higher-order tabled logic programming interpreter where some redundant and infinite computation is eliminated by memoizing sub-comput...
168
click to vote
SCAI
2001
15 years 7 months ago
2001
Muskens presents in Meaning and Partiality a semantics of possibly contradictory beliefs and other propositional attitudes. We propose a different partial logic based on a few key...
136
click to vote
LICS
2008
IEEE
15 years 12 months ago
2008
IEEE
We show that the asymptotic complexity of uniformly generated (expressible in First-Order (FO) logic) propositional tautologies for the Nullstellensatz proof system (NS) as well a...
169
click to vote
SAT
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. We continue a study initiated by Kraj´ıˇcek of a Resolutionlike proof system working with clauses of linear inequalities, R(CP). For all proof systems of this kind Kra...