Results 1  10
of
231,876
On the Complexity of Entailment in Propositional Multivalued Logics
, 1997
"... Multivalued logics have a long tradition in the philosophy and logic literature that originates from the work by / Lukaszewicz in the 20's. More recently, many AI researchers have been interested in this topic for both semantic and computational reasons. Multivalued logics have indeed been freq ..."
Abstract

Cited by 24 (0 self)
 Add to MetaCart
Multivalued logics have a long tradition in the philosophy and logic literature that originates from the work by / Lukaszewicz in the 20's. More recently, many AI researchers have been interested in this topic for both semantic and computational reasons. Multivalued logics have indeed been
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 578 (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
Automatic verification of finitestate concurrent systems using temporal logic specifications
 ACM Transactions on Programming Languages and Systems
, 1986
"... We give an efficient procedure for verifying that a finitestate concurrent system meets a specification expressed in a (propositional, branchingtime) temporal logic. Our algorithm has complexity linear in both the size of the specification and the size of the global state graph for the concurrent ..."
Abstract

Cited by 1387 (62 self)
 Add to MetaCart
We give an efficient procedure for verifying that a finitestate concurrent system meets a specification expressed in a (propositional, branchingtime) temporal logic. Our algorithm has complexity linear in both the size of the specification and the size of the global state graph for the concurrent
The fundamental properties of natural numbers
 Journal of Formalized Mathematics
, 1989
"... Summary. Some fundamental properties of addition, multiplication, order relations, exact division, the remainder, divisibility, the least common multiple, the greatest common divisor are presented. A proof of Euclid algorithm is also given. MML Identifier:NAT_1. WWW:http://mizar.org/JFM/Vol1/nat_1.h ..."
Abstract

Cited by 685 (73 self)
 Add to MetaCart
. The following proposition is true (2) 1 For every X such that 0 ∈ X and for every x such that x ∈ X holds x+1 ∈ X and for every k holds k ∈ X. Let n, k be natural numbers. Then n+k is a natural number. Let n, k be natural numbers. Note that n+k is natural. In this article we present several logical schemes
The Foundation of a Generic Theorem Prover
 Journal of Automated Reasoning
, 1989
"... Isabelle [28, 30] is an interactive theorem prover that supports a variety of logics. It represents rules as propositions (not as functions) and builds proofs by combining rules. These operations constitute a metalogic (or `logical framework') in which the objectlogics are formalized. Isabell ..."
Abstract

Cited by 471 (48 self)
 Add to MetaCart
Isabelle [28, 30] is an interactive theorem prover that supports a variety of logics. It represents rules as propositions (not as functions) and builds proofs by combining rules. These operations constitute a metalogic (or `logical framework') in which the objectlogics are formalized
Notes On Formalizing Context
, 1993
"... These notes discuss formalizing contexts as first class objects. The basic relation is ist(c; p). It asserts that the proposition p is true in the context c. The most important formulas relate the propositions true in different contexts. Introducing contexts as formal objects will permit axiomatizat ..."
Abstract

Cited by 417 (9 self)
 Add to MetaCart
These notes discuss formalizing contexts as first class objects. The basic relation is ist(c; p). It asserts that the proposition p is true in the context c. The most important formulas relate the propositions true in different contexts. Introducing contexts as formal objects will permit
Complexity and Expressive Power of Logic Programming
, 1997
"... This paper surveys various complexity results on different forms of logic programming. The main focus is on decidable forms of logic programming, in particular, propositional logic programming and datalog, but we also mention general logic programming with function symbols. Next to classical results ..."
Abstract

Cited by 365 (57 self)
 Add to MetaCart
This paper surveys various complexity results on different forms of logic programming. The main focus is on decidable forms of logic programming, in particular, propositional logic programming and datalog, but we also mention general logic programming with function symbols. Next to classical
The computational complexity of provability in systems of modal propositional logic
 SIAM Journal of Computing
, 1977
"... Abstract. The computational complexity of the provability problem in systems of modal propositional logic is investigated. Every problem computable in polynomial space is log space reducible to the provability problem in any modal system between K and $4. In particular, the provability problem in K ..."
Abstract

Cited by 241 (0 self)
 Add to MetaCart
Abstract. The computational complexity of the provability problem in systems of modal propositional logic is investigated. Every problem computable in polynomial space is log space reducible to the provability problem in any modal system between K and $4. In particular, the provability problem
The Fast Downward planning system
 Journal of Artifical Intelligence Research
, 2006
"... Fast Downward is a classical planning system based on heuristic search. It can deal with general deterministic planning problems encoded in the propositional fragment of PDDL2.2, including advanced features like ADL conditions and effects and derived predicates (axioms). Like other wellknown planne ..."
Abstract

Cited by 349 (29 self)
 Add to MetaCart
is first translated into an alternative representation called multivalued planning tasks, which makes many of the implicit constraints of a propositional planning task explicit. Exploiting this alternative representation, Fast Downward uses hierarchical decompositions of planning tasks for computing its
A Correspondence Theory for Terminological Logics: Preliminary Report
 In Proc. of IJCAI91
, 1991
"... We show that the terminological logic ALC comprising Boolean operations on concepts and value restrictions is a notational variant of the propositional modal logic K (m) . To demonstrate the utility of the correspondence, we give two of its immediate byproducts. Namely, we axiomatize ALC and give a ..."
Abstract

Cited by 307 (0 self)
 Add to MetaCart
We show that the terminological logic ALC comprising Boolean operations on concepts and value restrictions is a notational variant of the propositional modal logic K (m) . To demonstrate the utility of the correspondence, we give two of its immediate byproducts. Namely, we axiomatize ALC and give
Results 1  10
of
231,876