Results 1  10
of
970
Going NonClausal
 In 5th International Symposium on Theory and Applications of Satisfiability Testing
, 2002
"... The use of clauses and clauselike normal forms... In this paper I present a nonclausal 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 clauselike normal forms... In this paper I present a nonclausal 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
"... 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
"... 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 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
Extraction of Proofs from the Clausal Normal Form Transformation
"... 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 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
The Complexity of Clausal Fragments of LTL
"... Abstract. We introduce and investigate a number of fragments of propositional 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 propositional 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
"... 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 preprocessing 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 preprocessing techniques, our approach aims at improving the filtering power of the original clauses while producing a small number of additional
Clausal Resolution for CTL*
"... In this paper we consider proof techniques for branchingtime 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
"... 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