Stefan Brüning  Home/Search
Context
Related
| intellektik.informatik.tu...9317.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: intellektik.informatik.tu...9317 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Recently, three new deductive approaches for solving planning problems were proposed. These are based on the linear connection method, an equational Horn logic, and a fragment of linear logic. Their key idea is to treat facts about situations as resources which can be consumed and produced by actions. It was shown that the approaches are essentially equivalent. An important advantage of deductive approaches is the possibility to exploit powerful proof methods and techniques to reduce the... (Update)
Active bibliography (related documents): More All
1.9: A Disjunctive Positive Refinement of Model Elimination and its.. - Baumgartner (1995) (Correct)
0.3: Disjunction in Resource-Oriented Deductive Planning - Brüning, Hölldobler.. (1994) (Correct)
0.3: Some Termination Properties of Linear Completion - Privault, Richard (Correct)
Similar documents based on text: More All
0.8: Linear Deductive Planning - Große, Hölldobler, Schneeberger (1992) (Correct)
0.5: Objects, Specificity, Logic, and Chance - Hölldobler, Thielscher (Correct)
0.5: On Deductive Planning and the Frame Problem - Hölldobler (1992) (Correct)
BibTeX entry: (Update)
@misc{ ning-towards,
author = "Stefan Brüning",
title = "Towards Efficient Calculi for Resource-Oriented Deductive Planning",
url = "citeseer.ist.psu.edu/265653.html" }
Citations (may not include all citations):142 Automated Theorem Proving (context) - Bibel - 1987
111 A deductive solution for plan generation (context) - Bibel - 1988
66 Generating plans in linear logic (context) - Masseron, Tollu et al. - 1990
65 A new deductive approach to planning (context) - Holldobler, Schneeberger - 1989
41 Caching and Lemmaizing in Model Elimination Theorem Provers - Astrachan, Stickel - 1992
28 Relative Complexities of First Order Calculi (context) - Eder - 1992
23 An analysis of loop checking mechanisms for logic programmin.. (context) - Bol, Apt et al. - 1991
18 Controlling recursive inference (context) - Smith, Genesereth et al. - 1986
14 On linear deductive planning (context) - Groe, Holldobler et al. - 1992
14 A semi-reactive planner based on a possible models action fo.. (context) - Thi'ebaux, Hertzberg - 1992
12 An introduction to automated deduction (context) - Stickel - 1987
8 AC1-Unifikation in der linearen logischen Programmierung (context) - Thielscher - 1992
5 Deduktion --- Automatisierung der Logik (context) - Bibel - 1992
3 On infinite loops in logic programming (context) - Besnard - 1989
2 Memorization of literals: An enhancement of the connection m.. (context) - Fronhofer, Caferra - 1988
2 On Loop Detection in Connection Calculi (context) - Bruning - 1993
2 On refinements of the connection method (context) - Fronhofer - 1985
1 Lemma Usage in Connection Method Theorem Proving (context) - Neugebauer - 1991
1 the save termination of PROLOG programs (context) - Apt, Bol et al. - 1989
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