See this document in CiteSeerX!

A Deductive Database Approach to A.I. Planning  (Make Corrections)  
Antonio Brogi, V.S. Subrahmanian, Carlo Zaniolo



  Home/Search   Context   Related

 
View or download:
ucla.edu/~zaniolo/p...jiisplanning.pdf
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  ucla.edu/~zaniolo/papers/ (more)
Homepages:  C.Zaniolo  

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: In this paper, we show that the classical A.I. planning problem can be modelled using simple database constructs with logic-based semantics. The approach is similar to that used to model updates and nondetermism in active database rules. We begin by expressing plans by means of Datalog 1S programs and nondeterministic choice constructs, for which we provide a formal semantics using the concept of stable models. The resulting programs are characterized by a syntactic structure... (Update)

Similar documents (at the sentence level):
14.1%:   The Logic of Totally and Partially Ordered Plans: A Deductive.. - Antonio Brogi (1997)   (Correct)

Active bibliography (related documents):   More   All
0.6:   Generating Parallel Execution Plans with a Partial-Order Planner - Knoblock (1994)   (Correct)
0.4:   State Event Logic - Große, Khalil (1996)   (Correct)
0.4:   Propositional State-Event Logic - Große (1994)   (Correct)

Similar documents based on text:   More   All
0.3:   Relating Stable Models and AI Planning Domains - Subrahmanian, Zaniolo (1995)   (Correct)
0.1:   User-Defined Aggregates for Advanced Database Applications - Wang (2000)   (Correct)
0.1:   Database Updates and AI Planning Domains - Subrahmanian, al. (1993)   (Correct)

BibTeX entry:   (Update)

@misc{ brogi-deductive,
  author = "Antonio Brogi and V.S. Subrahmanian and Carlo Zaniolo",
  title = "A Deductive Database Approach to A.I. Planning",
  url = "citeseer.ist.psu.edu/687280.html" }
Citations (may not include all citations):
891   Strips: A new approach to the application of theorem proving.. (context) - Fikes, Nilsson - 1971
858   The stable model semantics for logic programming - Gelfond, Lifschitz - 1988
444   Towards a general theory of action and time (context) - Allen - 1984
256   Representing action and change by logic programs - Gelfond, Lifschitz - 1993
251   Generating project networks (context) - Tate - 1977
226   Systematic nonlinear planning - McAllester, Rosenblitt - 1991
182   An introduction to least commitment planning - Weld - 1995
175   Nonmonotonic logic and temporal projection (context) - Hanks, McDermott - 1987
163   Application of Theorem Proving to Problem Solving (context) - Green - 1969
78   Acyclic programs (context) - Apt, Bezem - 1990
74   Theorem Proving by Resolution as a Basis for Question-Answer.. (context) - Green - 1969
73   Theoretical Computer Science (context) - Bonner, Kifer et al. - 1994
69   Temporal reasoning in logic programming: A case for the situ.. - Pinto, Reiter - 1993
64   decidability and undecidability results for domain-independe.. (context) - Erol, Nau et al. - 1995
64   Stable models and non-determinism in logic programs with neg.. (context) - Sacca, Zaniolo - 1990
60   Temporal deductive databases - Chomicki - 1993
55   Nonmonotonic Logic (context) - Marek, Truszczynski - 1995
52   The Aditi deductive database system - Vaghani, Ramamohanarao et al. - 1994
41   A unified semantics for active and deductive databases - Zaniolo - 1993
34   default and auto-epistemic semantics for general logic progr.. (context) - Marek, Subrahmanian et al. - 1992
13   Applications of circumscription to formalising common sense .. (context) - McCarthy - 1986
13   Datalog with non-deterministic choice compute ndb-ptime (context) - Corciulo, Giannotti et al. - 1993
12   Polynomial-time computable queries in temporal deductive dat.. (context) - Chomicki - 1990
11   Negation and aggregates in recursive rules: the LDL++ approa.. (context) - Zaniolo, Arni et al.
7   Deterministic and Non-Deterministic Stable Models - Zaniolo - 1997
7   Greedy Algorithms in Datalog with Choice and Negation - Greco, Zaniolo - 1998
6   Complete determination of parallel actions and temporal opti.. (context) - Regnier, Fade - 1991
6   Towards a theory of simultaneous actions (context) - Grobe, Waldinger - 1991
5   North Holland Elsevier (context) - Kowalski, Problem - 1974
5   Transaction-conscious stable model semantics for active data.. (context) - Zaniolo - 1995
5   A theory of actions for multiagent planning (context) - George - 1984
4   Solving multiagent dynamic world problems in the classical p.. (context) - Pednault - 1986
3   Carlo Zaniolo: Nonmonotonic Reasoning in LDL (context) - Wang - 2000
2   the relation of classical and temporal planning (context) - Horz - 1993
1   Relating Logic Programming Theories of Actions and Partial O.. - Baral - 1997

Documents on the same site (http://www.cs.ucla.edu/~zaniolo/papers/):   More
Active Database Rules with Transaction Conscious Stable.. - Carlo Zaniolo Computer (1995)   (Correct)
ATLaS: a Small but Complete SQL Extension for Data Mining.. - Wang, Zaniolo, Luo (2003)   (Correct)
Publishing and Querying the Histories of Archived Relational.. - Wang, Zaniolo (2003)   (Correct)

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