Results 1  10
of
664,664
Applying the DavisPutnam procedure to nonclausal formulas
 In Proc. AI*IA'99, number 1792 in Lecture Notes in Arti Intelligence
, 1999
"... . Traditionally, the satisability problem for propositional logics deals with formulas in Conjunctive Normal Form (CNF). A typical way to deal with nonCNF formulas requires (i) converting them into CNF, and (ii) applying solvers usually based on the DavisPutnam (DP) procedure. A well known problem ..."
Abstract

Cited by 29 (6 self)
 Add to MetaCart
. Traditionally, the satisability problem for propositional logics deals with formulas in Conjunctive Normal Form (CNF). A typical way to deal with nonCNF formulas requires (i) converting them into CNF, and (ii) applying solvers usually based on the DavisPutnam (DP) procedure. A well known
On the Advantage of a NonClausal DavisPutnam Procedure
, 1997
"... We propose a nonclausal decision procedure for classical propositional logic. It is a generalization of the DavisPutnam procedure and deals with formulae which are not necessarily in clausal form. Since there is no need to translate the investigated formula into normal form, we avoid increasing it ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
We propose a nonclausal decision procedure for classical propositional logic. It is a generalization of the DavisPutnam procedure and deals with formulae which are not necessarily in clausal form. Since there is no need to translate the investigated formula into normal form, we avoid increasing
On the Advantage of a NonClausal DavisPutnam Procedure
 Hochschule Darmstadt, Fachbereich Informatik, Fachgebiet Intellektik, Alexanderstras e 10, D64283
, 1997
"... We propose a nonclausal decision procedure for classical propositional logic. It is a generalization of the DavisPutnam procedure and deals with formulae which are not necessarily in clausal form. Since there is no need to translate the investigated formula into normal form, we avoid increas ..."
Abstract
 Add to MetaCart
We propose a nonclausal decision procedure for classical propositional logic. It is a generalization of the DavisPutnam procedure and deals with formulae which are not necessarily in clausal form. Since there is no need to translate the investigated formula into normal form, we avoid
Applying GSAT to NonClausal Formulas
 JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH
, 1994
"... In this paper we describe how to modify GSAT so that it can be applied to nonclausal formulas. The idea is to use a function which computes the number of clauses of the CNF conversion of a formula which are false under a certain truth assignment, without constructing the conversion itself. The prop ..."
Abstract

Cited by 20 (4 self)
 Add to MetaCart
In this paper we describe how to modify GSAT so that it can be applied to nonclausal formulas. The idea is to use a function which computes the number of clauses of the CNF conversion of a formula which are false under a certain truth assignment, without constructing the conversion itself
Ordered Binary Decision Diagrams and the DavisPutnam Procedure
 IN PROC. OF THE 1ST INTERNATIONAL CONFERENCE ON CONSTRAINTS IN COMPUTATIONAL LOGICS
, 1994
"... We compare two prominent decision procedures for propositional logic: Ordered Binary Decision Diagrams (obdds) and the DavisPutnam procedure. Experimental results indicate that the DavisPutnam procedure outperforms obdds in hard constraintsatisfaction problems, while obdds are clearly superior for ..."
Abstract

Cited by 49 (1 self)
 Add to MetaCart
We compare two prominent decision procedures for propositional logic: Ordered Binary Decision Diagrams (obdds) and the DavisPutnam procedure. Experimental results indicate that the DavisPutnam procedure outperforms obdds in hard constraintsatisfaction problems, while obdds are clearly superior
Implementing the DavisPutnam Method
 Journal of Automated Reasoning
, 2000
"... The method proposed by Davis, Putnam, Logemann, and Loveland for propositional reasoning, often referred to as the DavisPutnam method, is one of the major practical methods for the satisfiability (SAT) problem of propositional logic. We show how to implement the DavisPutnam method efficiently usin ..."
Abstract

Cited by 59 (3 self)
 Add to MetaCart
using the trie data structure for propositional clauses. A new technique of indexing only the first and last literals of clauses yields a unit propagation procedure whose complexity is sublinear to the number of occurrences of the variable in the input. We also show that the DavisPutnam method can work
The efficiency of resolution and DavisPutnam procedures
 SIAM Journal on Computing
, 1999
"... We consider several problems related to the use of resolutionbased methods for determining whether a given boolean formula in conjunctive normal form is satisfiable. First, building on work of Clegg, Edmonds and Impagliazzo, we give an algorithm for satisfiability that when given an unsatisfiabl ..."
Abstract

Cited by 66 (1 self)
 Add to MetaCart
an unsatisfiable formula of F finds a resolution proof of F , and the runtime of our algorithm is nontrivial as a function of the size of the shortest resolution proof of F . Next we investigate a class of backtrack search algorithms, commonly known as DavisPutnam procedures and provide the first average
A transformational decision procedure for nonclausal propositional formulas
 CoRR
"... A decision procedure for propositional logic is presented. This procedure is based on the DavisPutnam method. Propositional formulas are initially converted to negational normal form. This procedure determines whether a formula is valid or not by making validitypreserving transformations of fragme ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
A decision procedure for propositional logic is presented. This procedure is based on the DavisPutnam method. Propositional formulas are initially converted to negational normal form. This procedure determines whether a formula is valid or not by making validitypreserving transformations
Partial implicit unfolding in the davisputnam procedure for quantified boolean formulae
 In Proceedings of the International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR’01
, 2001
"... Abstract. Quantified Boolean formulae offer a means of representing many propositional formula exponentially more compactly than propositional logic. Recent work on automating reasoning with QBF has concentrated on extending the DavisPutnam procedure to handle QBF. Although the resulting procedures ..."
Abstract

Cited by 33 (0 self)
 Add to MetaCart
Abstract. Quantified Boolean formulae offer a means of representing many propositional formula exponentially more compactly than propositional logic. Recent work on automating reasoning with QBF has concentrated on extending the DavisPutnam procedure to handle QBF. Although the resulting
Reductions for NonClausal Theorem Proving
, 2001
"... This paper presents the TAS methodology 1 as a new framework for generating nonclausal Automated Theorem Provers. We present a complete description of the ATP for Classical Propositional Logic, named TASD, but the ideas, which made use of implicants and implicates can be extended in a natural man ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
manner to firstorder logic, and nonclassical logics. The method is based on the application of a number of reduction strategies on subformulas, in a rewritesystem style, in order to reduce the complexity of the formula as much as possible before branching. Specifically, we introduce the concept
Results 1  10
of
664,664