Results 11  20
of
2,190
A Simplifier for Propositional Formulas with Many Binary Clauses
, 2001
"... Deciding whether a propositional formula in conjunctive normal form is satisfiable (SAT) is an NPcomplete problem. The problem becomes linear when the formula contains binary clauses only. Interestingly, the reduction to SAT of a number of wellknown and important problems  such as classical AI p ..."
Abstract

Cited by 59 (2 self)
 Add to MetaCart
Deciding whether a propositional formula in conjunctive normal form is satisfiable (SAT) is an NPcomplete problem. The problem becomes linear when the formula contains binary clauses only. Interestingly, the reduction to SAT of a number of wellknown and important problems  such as classical AI
Detecting Inadmissible and Necessary Variables in Large Propositional Formulae
 University of Siena
, 2001
"... A variable in a propositional formula is called inadmissible (necessary) if it is false (true) in each satisfying variable assignment of the formula. We describe and compare three algorithms for the detection of the set of necessary and inadmissible variables of a formula using SAT methods: a basic ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
A variable in a propositional formula is called inadmissible (necessary) if it is false (true) in each satisfying variable assignment of the formula. We describe and compare three algorithms for the detection of the set of necessary and inadmissible variables of a formula using SAT methods: a basic
Simultaneous Construction of Refutations and Models for Propositional Formulas
, 1995
"... Methodology is developed to attempt to construct simultaneously either a refutation or a model for a propositional formula in conjunctive normal form. The method exploits the concept of "autarky", which was introduced by Monien and Speckenmeyer. Informally, an autarky is a "selfsuf ..."
Abstract

Cited by 8 (5 self)
 Add to MetaCart
Methodology is developed to attempt to construct simultaneously either a refutation or a model for a propositional formula in conjunctive normal form. The method exploits the concept of "autarky", which was introduced by Monien and Speckenmeyer. Informally, an autarky is a "
Reasoning with Examples: Propositional Formulae and Database Dependencies
"... For humans, looking at how concrete examples behave is an intuitive way of deriving conclusions. The drawback with this method is that it does not necessarily give the correct results. However, under certain conditions examplebased deduction can be used to obtain a correct and complete inference pr ..."
Abstract

Cited by 18 (5 self)
 Add to MetaCart
procedure. This is the case for Boolean formulae (reasoning with models) and for certain types of database integrity constraints (the use of Armstrong relations). We show that these approaches are closely related, and use the relationship to prove new results about the existence and sizes of Armstrong
Semantic Minimization of 3Valued Propositional Formulae
 In Proc. Symp. on Logic in Comp. Sci
, 2002
"... This paper presents an algorithm for a nonstandard logicminimization problem that arises in 3valued propositional logic. The problem is motivated by the potential for obtaining better answers in applications that use 3valued logic. An answer of 0 or 1 provides precise (definite) information; an a ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
This paper presents an algorithm for a nonstandard logicminimization problem that arises in 3valued propositional logic. The problem is motivated by the potential for obtaining better answers in applications that use 3valued logic. An answer of 0 or 1 provides precise (definite) information
The Complexity of Checking Redundancy of CNF Propositional Formulae
 In Proc. 15th European Conference on Artificial Intelligence
, 2002
"... A knowledge base is redundant if it contains parts that can be inferred from the rest of it. We study the problem of checking whether a CNF formula (a set of clauses) is redundant, that is, it contains clauses that can be derived from the other ones. Any CNF formula can be made irredundant by deleti ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
A knowledge base is redundant if it contains parts that can be inferred from the rest of it. We study the problem of checking whether a CNF formula (a set of clauses) is redundant, that is, it contains clauses that can be derived from the other ones. Any CNF formula can be made irredundant
Smallest Equivalent Sets for Finite Propositional Formula Circumscription
, 2000
"... Abstract Circumscription uses classical logic in order to modelize rules with exceptions and implicit knowledge. Formula circumscription is known to be easier to use in order to modelize a situation. We describe when two sets of formulas give the same result, when circumscribed. Two kinds of such eq ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract Circumscription uses classical logic in order to modelize rules with exceptions and implicit knowledge. Formula circumscription is known to be easier to use in order to modelize a situation. We describe when two sets of formulas give the same result, when circumscribed. Two kinds
Semantic Minimization of 3Valued Propositional Formulae\Lambda
"... Abstract This paper presents an algorithm for a nonstandard logicminimization problem that arises in 3valued propositionallogic. The problem is motivated by the potential for obtaining better answers in applications that use 3valued logic.An answer of 0 or 1 provides precise (definite) informati ..."
Abstract
 Add to MetaCart
) information;an answer of 1=2 provides imprecise (indefinite) information. By replacing a formula ' with a "better " formula,we may improve the precision of the answers obtained. In this paper, we give an algorithm that always produces a formula that is "best " (in a
The Complexity of Checking Redundancy of CNF Propositional Formulae
"... Abstract. A knowledge base is redundant if it contains parts that can be inferred from the rest of it. We study the problem of checking whether a CNF formula (a set of clauses) is redundant, that is, it contains clauses that can be derived from the other ones. Any CNF formula can be made irredundant ..."
Abstract
 Add to MetaCart
Abstract. A knowledge base is redundant if it contains parts that can be inferred from the rest of it. We study the problem of checking whether a CNF formula (a set of clauses) is redundant, that is, it contains clauses that can be derived from the other ones. Any CNF formula can be made
Results 11  20
of
2,190