Wolfgang Bibel. A deductive solution for plan generation. New Generation Computing,4:115--132, 1986. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
The Fluent Calculus - A Specification Language for Robots with.. - Thielscher (2000) (2 citations) (Correct)
....to address all of the aspects listed above in a uniform way. The calculus roots in the logic programming formalism of [21] which in [18] has been proved equivalent to approaches to the Frame Problem that appeal to non classical logics, namely, linearized versions of the connection method [3] and Gentzen s sequent calculus [37] resp. All three frameworks have been designed especially to address not only the representational but also the inferential aspect of the Frame Problem [4] These approaches have thus been characterized as attempts to reconcile the expressive power of logical ....
Wolfgang Bibel. A deductive solution for plan generation. New Generation Computing, 4:115--132, 1986.
Solving Deductive Planning Problems Using Program Analysis.. - de Waal, Thielscher (1996) (Correct)
.... methods for reasoning about change are based on the ideas underlying the situation calculus [20, 21] Yet in recent years new deductive approaches have been developed which enable us to model situations, actions, and causality without the need to employ extra axioms due to the frame problem [1, 19, 14]. Instead of representing the atomic facts used to describe situations as fluents, these approaches take the facts as resources. Resources do not hold forever they are consumed and produced by actions. Consequently, resources which are not a#ected by an action remain as they are and need not be ....
W. Bibel. A Deductive Solution for Plan Generation. New Generation Computing, 4:115--132, 1986.
Equational Logic Programming, Actions, and Change - Große, Hölldobler.. (1992) (Correct)
....only linear proofs, i.e. proofs in which each literal is used at most once. Unfortunately, Bibel was unable to give a semantics for the linear connection method and as R. Kowalski states if Bibel s system really works, then it deserves an explanation and it deserves a semantics (see Discussion in [4]) Recently, M. Masseron et al. 20] applied the multiplicative fragment of linear logic [11] to planning and showed that in this framework planning problems can also be solved without frame axioms. A di#erent approach to deductive planning, which also avoids the frame axioms, was given in [15] ....
W. Bibel. A deductive solution for plan generation. In J. W. Schmidt and C. Thanos, editors, Foundations of Knowledge Base Management, pages 453 -- 473. Springer, 1989. XII.
Equational Logic Programming, Actions, and Change - Große, Hölldobler.. (1992) (Correct)
....who introduced a di#erent representation of fluents using a Holds predicate. However, these frame axioms still pose a considerable problem to automated theorem provers as they may lead to many redundant derivations and the application of these axioms must be deferred as long as possible. W. Bibel [3] used a modified version of his connection method to solve the frame problem without the need of any frame axioms. He considered only linear proofs, i.e. proofs in which each literal is used at most once. Unfortunately, Bibel was unable to give a semantics for the linear connection method and as R. ....
....as well as the postcondition of an action are just collections of fluents which can intuitively be understood as conjunctions of fluents. A more precise interpretation will be given in Section 4. This restriction holds also for [20] W. Bibel allows a more general form, but all examples given in [3, 5] are restricted in precisely the same way. The purpose of this paper is as follows. 1. We proved that the equational logic programming approach to deductive planning is equivalent to a the linear connection method and the linear logic approach to deductive planning. This result is obtained by ....
[Article contains additional citation context not shown here]
W. Bibel. A deductive solution for plan generation. New Generation Computing, 4:115--132, 1986.
Deductive Plan Generation - Bibel, Thielscher (1994) Self-citation (Bibel) (Correct)
No context found.
W. Bibel. A Deductive Solution for Plan Generation. In J. W. Schmidt and C. Thanos, editors, Foundations of Knowledge Base Management, pages 453--473. Springer, 1989.
Deductive Plan Generation - Bibel, Thielscher (1994) Self-citation (Bibel) (Correct)
No context found.
W. Bibel. A Deductive Solution for Plan Generation. New Generation Computing, 4:115--132, 1986.
Linear Logic and Noncommutativity in the Calculus of Structures - Straßburger (2003) (Correct)
No context found.
Wolfgang Bibel. A deductive solution for plan generation. New Generation Computing,4:115--132, 1986.
Towards Planning as Concurrency - Kahramanogullari (2005) (1 citation) (Correct)
No context found.
Wolfgang Bibel. A deductive solution for plan generation. In New Generation Computing, pages 115--132. 1986.
A New Logical Notion of Partial Order Planning - Kahramanogullari (Correct)
No context found.
Wolfgang Bibel. A deductive solution for plan generation. In New Generation Computing, pages 115--132. 1986.
A New Logical Notion of Partial Order Planning - Kahramanogullar (Correct)
No context found.
Wolfgang Bibel. A deductive solution for plan generation. In New Generation Computing, pages 115--132. 1986.
Towards Planning as Concurrency - Kahramanogullari (2005) (1 citation) (Correct)
No context found.
Wolfgang Bibel. A deductive solution for plan generation. In New Generation Computing, pages 115--132. 1986.
Plans as Formulae with a Non-commutative Logical Operator -.. - Kahramanogullari (Correct)
No context found.
Wolfgang Bibel. A deductive solution for plan generation. In New Generation Computing, pages 115--132. 1986.
Linear Logic and Noncommutativity in the Calculus of Structures - Straßburger (2003) (21 citations) (Correct)
No context found.
Wolfgang Bibel. A deductive solution for plan generation. New Generation Computing,4:115--132, 1986.
Unknown - Linear Logic Programming (Correct)
No context found.
Wolfgang Bibel. A deductive solution for plan generation. New Generation Computing, 4:115--132, 1986.
Termination - As The Example (Correct)
No context found.
Wolfgang Bibel. A deductive solution for plan generation. New Generation Computing, 4:115--132, 1986.
Unknown - Linear Type Theory (Correct)
No context found.
Wolfgang Bibel. A deductive solution for plan generation. New Generation Computing, 4:115--132, 1986.
For the Completness Direction We Need to Generalize the.. - Theorem Completeness Of (Correct)
No context found.
Wolfgang Bibel. A deductive solution for plan generation. New Generation Computing, 4:115--132, 1986.
Unknown - Linear Calculus In (Correct)
No context found.
Wolfgang Bibel. A deductive solution for plan generation. New Generation Computing, 4:115--132, 1986.
Unknown - Linear Logic Programming (Correct)
No context found.
Wolfgang Bibel. A deductive solution for plan generation. New Generation Computing, 4:115-132, 1986.
Representing Concurrent Actions and Solving Conflicts - Bornscheuer, Thielscher (1994) (7 citations) (Correct)
No context found.
W. Bibel. A Deductive Solution for Plan Generation. New Generation Computing, 4:115--132, 1986
Unknown - Linear Type Theory (Correct)
No context found.
Wolfgang Bibel. A deductive solution for plan generation. New Generation Computing, 4:115-132, 1986.
A Theory of First-Order Counterfactual Reasoning - Thielscher (Correct)
No context found.
W. Bibel. A deductive solution for plan generation. New Gener. Comput., 4:115-- 132, 1986.
Computing Ramifications by Postprocessing - Thielscher (1995) (16 citations) (Correct)
No context found.
W. Bibel. A Deductive Solution for Plan Generation. New Generation Computing, 4:115--132, 1986. This example is due to N. McCain and H. Turner.
Representing Actions in Equational Logic Programming - Thielscher (1994) (14 citations) (Correct)
No context found.
W. Bibel. A Deductive Solution for Plan Generation. New Generation Computing, 4:115--132, 1986.
Unknown - Linear Calculus In (Correct)
No context found.
Wolfgang Bibel. A deductive solution for plan generation. New Generation Computing, 4:115-132, 1986.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC