Results 1 - 10 of 1,526

Planning with Effectively Propositional Logic

by Juan Antonio Navarro-pérez, Andrei Voronkov
"... Abstract. We present a fragment of predicate logic which allows the use of equality and quantification but whose models are limited to finite Her-brand interpretations. Formulae in this logic can be thought as syntactic sugar on top of the Bernays-Schönfinkel fragment and can, therefore, still be e ..."
Abstract - Add to MetaCart
be effectively grounded into a propositional representation. We motivate the study of this logic by showing that practical problems from the area of planning can be naturally and succinctly represented using the added syntactic features. Moreover, from a theoretical point of view, we show that this logic allows

Pushing the Envelope: Planning, Propositional Logic, and Stochastic Search

by Henry Kautz, Bart Selman , 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

Motivation through the Design of Work: Test of a Theory. Organizational Behavior and Human Performance,

by ] Richard Hackman , Grec R Oldham , 1976
"... A model is proposed that specifies the conditions under which individuals will become internally motivated to perform effectively on their jobs. The model focuses on the interaction among three classes of variables: (a) the psychological states of employees that must be present for internally motiv ..."
Abstract - Cited by 622 (2 self) - Add to MetaCart
and analysis; and to Gerrit Wolf for help in analytic planning. This report was prepared in connection with research supported by the Office of Naval Research (Organizational Effectiveness Research Program,, and by the Manpower Administration, U. S. Department of Labor . Since grantees conducting research

Encoding Plans in Propositional Logic

by Henry Kautz, David Mcallester, Bart Selman , 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

The Fast Downward planning system

by Malte Helmert - 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 well-known planne ..."
Abstract - Cited by 347 (29 self) - Add to MetaCart
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 well

Using Temporal Logics to Express Search Control Knowledge for Planning

by Fahiem Bacchus, Froduald Kabanza - ARTIFICIAL INTELLIGENCE , 1999
"... Over the years increasingly sophisticated planning algorithms have been developed. These have made for more efficient planners, but unfortunately these planners still suffer from combinatorial complexity even in simple domains. Theoretical results demonstrate that planning is in the worst case in ..."
Abstract - Cited by 330 (15 self) - Add to MetaCart
intractable. Nevertheless, planning in particular domains can often be made tractable by utilizing additional domain structure. In fact, it has long been acknowledged that domain independent planners need domain dependent information to help them plan effectively. In this

Actions and Events in Interval Temporal Logic,"

by James F Allen , George Ferguson - Journal of Logic and Computation, , 1994
"... Abstract We present a representation of events and action based on interval temporal logic that is significantly more expressive and more natural than most previous AI approaches. The representation is motivated by work in natural language semantics and discourse, temporal logic, and AI planning an ..."
Abstract - Cited by 309 (7 self) - Add to MetaCart
Abstract We present a representation of events and action based on interval temporal logic that is significantly more expressive and more natural than most previous AI approaches. The representation is motivated by work in natural language semantics and discourse, temporal logic, and AI planning

An Algorithm for Probabilistic Planning

by Nicholas Kushmerick, Steve Hanks, Daniel Weld , 1995
"... We define the probabilistic planning problem in terms of a probability distribution over initial world states, a boolean combination of propositions representing the goal, a probability threshold, and actions whose effects depend on the execution-time state of the world and on random chance. Adoptin ..."
Abstract - Cited by 286 (20 self) - Add to MetaCart
We define the probabilistic planning problem in terms of a probability distribution over initial world states, a boolean combination of propositions representing the goal, a probability threshold, and actions whose effects depend on the execution-time state of the world and on random chance

Encoding HTN Planning in Propositional Logic

by Amol D. Mali, Subbarao Kambhampati - In Proc. 4th Intl. Conf. AI Planning Systems
"... Casting planning problems as propositional satisfiability problems has recently been shown to be an effective way of scaling up plan synthesis. Until now, the benefits of this approach have only been utilized in primitive action-based planning models. Motivated by the conventional wisdom in the plan ..."
Abstract - Cited by 14 (1 self) - Add to MetaCart
Casting planning problems as propositional satisfiability problems has recently been shown to be an effective way of scaling up plan synthesis. Until now, the benefits of this approach have only been utilized in primitive action-based planning models. Motivated by the conventional wisdom

Spatial Reasoning with Propositional Logics

by Brandon Bennett - 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 1st-order predicate calculus. Whilst this language is much more expr ..."
Abstract - Cited by 111 (16 self) - Add to MetaCart
expressive than 0-order (propositional) calculi it is correspondingly harder to reason with. Hence, by encoding spatial relationships in a propositional representation automated reasoning becomes more effective. I specify representations in both classical and intuitionistic propositional logic, which
Results 1 - 10 of 1,526