Results 1 - 10 of 970

Going Non-Clausal

by Zbigniew Stachniak - In 5th International Symposium on Theory and Applications of Satisfiability Testing , 2002
"... The use of clauses and clause-like normal forms... In this paper I present a non-clausal stochastic local search satisfiability procedure for classical propositional logic that avoids the translation of an input formula into clauses. This new procedure, called polWSAT, resembles clausal Walksat solv ..."
Abstract - Cited by 8 (3 self) - Add to MetaCart
The use of clauses and clause-like normal forms... In this paper I present a non-clausal stochastic local search satisfiability procedure for classical propositional logic that avoids the translation of an input formula into clauses. This new procedure, called polWSAT, resembles clausal Walksat

Algorithms for Guiding Clausal Temporal Resolution

by M. Carmen Fernández Gago, M. Carmen Fern, Ez Gago, Michael Fisher, Clare Dixon
"... Clausal temporal resolution is characterised by a translation of the formulae whose satisfiability is to be established to a normal form, step resolution (similar to classical resolution) on formulae occurring at the same states and temporal resolution between formulae describing properties over a l ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Clausal temporal resolution is characterised by a translation of the formulae whose satisfiability is to be established to a normal form, step resolution (similar to classical resolution) on formulae occurring at the same states and temporal resolution between formulae describing properties over a

Implementing the Clausal Normal Form Transformation with Proof Generation

by Hans De Nivelle
"... Abstract. We explain how we intend to implement the clausal normal form transformation with proof generation. We present a convenient data structure for sequent calculus proofs, which will be used for representing the generated proofs. The data structure allows easy proof checking and generation of ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
Abstract. We explain how we intend to implement the clausal normal form transformation with proof generation. We present a convenient data structure for sequent calculus proofs, which will be used for representing the generated proofs. The data structure allows easy proof checking and generation

On the Advantage of a Non-Clausal Davis-Putnam Procedure

by Jens Otten , 1997
"... We propose a non-clausal decision procedure for classical propositional logic. It is a generalization of the Davis-Putnam 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 non-clausal decision procedure for classical propositional logic. It is a generalization of the Davis-Putnam 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

Extraction of Proofs from the Clausal Normal Form Transformation

by unknown authors
"... Abstract. This paper discusses the problem of how to transform a firstorder formula into clausal normal form, and to simultaneously construct a proof that the clausal normal form is correct. This is relevant for applications of automated theorem proving where people want to be able to use theorem pr ..."
Abstract - Add to MetaCart
Abstract. This paper discusses the problem of how to transform a firstorder formula into clausal normal form, and to simultaneously construct a proof that the clausal normal form is correct. This is relevant for applications of automated theorem proving where people want to be able to use theorem

On the Advantage of a Non-Clausal Davis-Putnam Procedure

by Fachgebiet Intellektik, Fachbereich Informatik, Jens Otten, Jens Otten, Technische Hochschule Darmstadt, Technische Hochschule Darmstadt - Hochschule Darmstadt, Fachbereich Informatik, Fachgebiet Intellektik, Alexanderstras e 10, D-64283 , 1997
"... We propose a non-clausal decision procedure for classical propositional logic. It is a generalization of the Davis-Putnam 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 non-clausal decision procedure for classical propositional logic. It is a generalization of the Davis-Putnam 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

The Complexity of Clausal Fragments of LTL

by A. Artale, R. Kontchakov, V. Ryzhikov, M. Zakharyaschev
"... Abstract. We introduce and investigate a number of fragments of propo-sitional temporal logic LTL over the flow of time (Z, <). The fragments are defined in terms of the available temporal operators and the structure of the clausal normal form of the temporal formulas. We determine the computatio ..."
Abstract - Cited by 4 (2 self) - Add to MetaCart
Abstract. We introduce and investigate a number of fragments of propo-sitional temporal logic LTL over the flow of time (Z, <). The fragments are defined in terms of the available temporal operators and the structure of the clausal normal form of the temporal formulas. We determine

Vivifying Propositional Clausal Formulae

by Cédric Piette, Youssef Hamadi, Lakhdar Saïs
"... Abstract. In this paper, we present a new way to preprocess Boolean formulae in Conjunctive Normal Form (CNF). In contrast to most of the current pre-processing techniques, our approach aims at improving the filtering power of the original clauses while producing a small number of additional and rel ..."
Abstract - Cited by 6 (1 self) - Add to MetaCart
Abstract. In this paper, we present a new way to preprocess Boolean formulae in Conjunctive Normal Form (CNF). In contrast to most of the current pre-processing techniques, our approach aims at improving the filtering power of the original clauses while producing a small number of additional

Clausal Resolution for CTL*

by Alexander Bolotov, Clare Dixon, Michael Fisher
"... In this paper we consider proof techniques for branching-time temporal logics. While a considerable amount of research has been carried out regarding the relationship between finite automata and such logics, practical proof techniques for such logics have received relatively little attention. Rec ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
-time framework, in particular to the powerful CTL* logic. The key elements of the resolution method, namely the normal form, the concept of step resolution and a novel temporal resolution rule, are introduced, justified, and applied.

Simplification of Horn Clauses that are Clausal Forms of Guarded Formulas

by unknown authors
"... 0 such that the least Herbrand models of S and S 0 coincide on predicate symbols that occur in S. This transformation is done in the following way: first, de Nivelle's saturation procedure is applied on the given set S, and certain clauses are extracted form the resulting set. Then, a resolutio ..."
Abstract - Add to MetaCart
: it is decidable, each of its satisfiable formulas allows a finite model, and many modal logics can be translated into it. Transformation of guarded formulas into clausal form has inspired the class of guarded clauses. Decidability of sets of guarded clauses by saturation under ordered resolution has been shown
Results 1 - 10 of 970