Results 1  10
of
5,501
Pushing the Envelope: Planning, Propositional Logic, and Stochastic Search
, 1996
"... Planning is a notoriously hard combinatorial search problem. In many interesting domains, current planning algorithms fail to scale up gracefully. By combining a general, stochastic search algorithm and appropriate problem encodings based on propositional logic, we are able to solve hard planning pr ..."
Abstract

Cited by 579 (33 self)
 Add to MetaCart
Planning is a notoriously hard combinatorial search problem. In many interesting domains, current planning algorithms fail to scale up gracefully. By combining a general, stochastic search algorithm and appropriate problem encodings based on propositional logic, we are able to solve hard planning
PROPOSITIONAL LOGIC
, 2008
"... Intuitionistic logic is an important variant of classical logic, but it is not as wellunderstood, even in the propositional case. In this thesis, we describe a faithful representation of intuitionistic propositional formulas as tree automata. This representation permits a number of consequences, inc ..."
Abstract
 Add to MetaCart
Intuitionistic logic is an important variant of classical logic, but it is not as wellunderstood, even in the propositional case. In this thesis, we describe a faithful representation of intuitionistic propositional formulas as tree automata. This representation permits a number of consequences
Propositional Logic
"... hat have been studied extensively. For example, "A is false", "A is true at time t" (from temporal Draft of August 31, 2000 6 Propositional Logic logic), "A is necessarily true " (from modal logic), "program M has type #"(from programming languages), etc. Re ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
hat have been studied extensively. For example, "A is false", "A is true at time t" (from temporal Draft of August 31, 2000 6 Propositional Logic logic), "A is necessarily true " (from modal logic), "program M has type #"(from programming languages), etc
Propositional Logic of Context
 IN PROCEEDINGS OF THE ELEVENTH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE
, 1993
"... In this paper we investigate the simple logical properties of contexts. We describe both the syntax and semantics of a general propositional language of context, and give a Hilbert style proof system for this language. A propositional logic of context extends classical propositional logic in t ..."
Abstract

Cited by 117 (6 self)
 Add to MetaCart
In this paper we investigate the simple logical properties of contexts. We describe both the syntax and semantics of a general propositional language of context, and give a Hilbert style proof system for this language. A propositional logic of context extends classical propositional logic
Spatial Reasoning with Propositional Logics
 Principles of Knowledge Representation and Reasoning: Proceedings of the 4th International Conference (KR94
, 1994
"... I present a method for reasoning about spatial relationships on the basis of entailments in propositional logic. Formalisms for representing topological and other spatial information (e.g. [2] [10] [11]) have generally employed the 1storder predicate calculus. Whilst this language is much more expr ..."
Abstract

Cited by 111 (16 self)
 Add to MetaCart
I present a method for reasoning about spatial relationships on the basis of entailments in propositional logic. Formalisms for representing topological and other spatial information (e.g. [2] [10] [11]) have generally employed the 1storder predicate calculus. Whilst this language is much more
Encoding Plans in Propositional Logic
, 1996
"... In recent work we showed that planning problems can be efficiently solved by general propositional satisfiability algorithms (Kautz and Selman 1996). A key issue in this approach is the development of practical reductions of planning to SAT. We introduce a series of different SAT encodings for STRIP ..."
Abstract

Cited by 173 (9 self)
 Add to MetaCart
In recent work we showed that planning problems can be efficiently solved by general propositional satisfiability algorithms (Kautz and Selman 1996). A key issue in this approach is the development of practical reductions of planning to SAT. We introduce a series of different SAT encodings
Equational propositional logic
 Inf. Process. Lett
, 1995
"... We formalize equational propositional logic, prove that it is sound and complete, and compare the equationalproof style with the more traditional Hilbert style. ..."
Abstract

Cited by 13 (3 self)
 Add to MetaCart
We formalize equational propositional logic, prove that it is sound and complete, and compare the equationalproof style with the more traditional Hilbert style.
Counting proofs in propositional logic
, 2008
"... We give a procedure for counting the number of different proofs of a formula in various sorts of propositional logic. This number is either an integer (that may be 0 if the formula is not provable) or infinite. 1 ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We give a procedure for counting the number of different proofs of a formula in various sorts of propositional logic. This number is either an integer (that may be 0 if the formula is not provable) or infinite. 1
Propositional Logic, Web.
"... verification system for propositional logic. It provides a webbased interface for teaching propositional logic proofs, and accepts any valid direct proof. Oliver provides instant feedback to students as to whether each step is correct or not, encourages experimentation by students and is integrated ..."
Abstract
 Add to MetaCart
verification system for propositional logic. It provides a webbased interface for teaching propositional logic proofs, and accepts any valid direct proof. Oliver provides instant feedback to students as to whether each step is correct or not, encourages experimentation by students
Results 1  10
of
5,501