P. Doherty, J. Gustafsson, L. Karlsson, and J. Kvarnstrom. Tal: Temporal action logics -- language specification and tutorial. Electronic Transactions on Artificial Intelligence, 3(15), 1998.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....also observations about non initial time points. He also mentions that Lifschitz in [Lif95] having formulated filtering as nested circumscription and showing its use for nonmonotonic applications in several areas, including several approaches to the frame problem. In the recent survey article [DGKK98] Doherty et al. also members of Sandewall s group at Linkoping University) discuss their language TAL, which is based on PMON [Doh94a] a logic from [San89] which is defined using filtering. Thus, while filtering is used only in some of the entailment relations defined in [San94] it is part ....

P. Doherty, J. Gustafsson, L. Karlsson, and J. Kvarnstrom. TAL: Temporal action logics -- language specification and tutorial. Electronic Transactions on Artificial Intelligence, 3(15):(http://www.ep.liu.se/ej/etai/1998/015), 1998.

....that are always invoked. This allows us to express many common constructions, for example state constraints, but still keep an object oriented viewpoint. A constraint method can in some senses be compared to an invariant. 2 TAL C: Temporal Action Logic In this section, we briefly introduce TAL C [8, 9], which will be used as a basis for a proposal for modeling some aspects of object orientation. The basic approach we use for reasoning about action and change (RAC) is as follows. First, represent a narrative in the surface language L(ND) which is a high level language for representing ....

....are circumscribed with Occlude minimized and Holds fixed. The result is then filtered with two nochange axioms, the observations, and some foundational axioms such as unique names and temporal structure axioms. The translation from L(ND) to L(FL) is straightforward and the reader is referred to [8, 9] for details concerning translation and the logic used. Before we describe the operators of L(ND) we consider how to define fluent value domains. ffl The simplest way of defining a domain is by directly listing its elements. A simple example of this is dom boolean = f ; g ffl A more dynamical ....

P. Doherty, J. Gustafsson, L. Karlsson, and J. Kvarnstrom. TAL: Temporal action logics language specification and tutorial. Linkoping Electronic Articles in Computer and Information Science,

....domain dependent knowledge to control search. On the other hand, there are also a number of significant differences between the planners. ffl While TLplan uses a temporal logic only for specifying control knowledge, the formal basis for TALplanner originates from Temporal Action Logics (TAL) [14], a family of narrative based logics for reasoning about action and change in dynamic and incompletely specified environments. TALplanner accepts a TAL goal narrative as input and generates a TAL plan narrative as output. Thus, TAL serves as a reference formalism for TALplanner, where the language ....

....In Section 8, the three different versions of TALplanner are empirically tested using a number of standard and extended benchmarks. The results are provided and discussed. Finally, Section 9 concludes with discussion and future work. 2. TAL: Temporal Action Logics TAL, Temporal Action Logics [14], is a family of non monotonic temporal logics developed for reasoning about action and change in dynamic and incompletely specified domains. The TAL logics originate from the Features and Fluents framework developed by Sandewall [36] TAL is a narrative based formalism, where narratives are ....

[Article contains additional citation context not shown here]

P. Doherty, J. Gustafsson, L. Karlsson, and J. Kvarnstrom, `TAL: Temporal Action Logics -- language specification and tutorial', Linkoping Electronic Articles in Computer and Information Science, 3(15), (September

.... domain (Section 4) and some elaborations of this domain (Section 5) briefly mention the Tra#c World domain (Section 6) and finally conclude with related work (Section 7) and a discussion of the results (Section 8) 1 2 The TAL C Logic TAL C [11] is a member of the TAL (Temporal Action Logics [9]) family of logics. The basic approach for reasoning about action and change in TAL is as follows. First, represent a narrative in the surface language L(ND) a high level macro language for representing observations, action descriptions, action occurrences, domain constraints, and dependency ....

....domain closure (all value domains are finite) and temporal structure axioms. The second order theory can be translated into a logically equivalent firstorder theory which is used to reason about the narrative. The translation from L(ND) to L(FL) is straightforward and the reader is referred to [9, 11] for details. 2.1 Macros in L(ND) Since the purpose of this paper is not to extend TAL but to show how the object oriented paradigm can be used to succinctly structure large axiomatic theories, only those L(ND) macros that will be used in the examples will be described. A fixed fluent formula ....

P. Doherty, J. Gustafsson, L. Karlsson, and J. Kvarnstrom. TAL: Temporal Action Logics -- language specification and tutorial. Linkoping Electronic Articles in Computer and Information Science, 3(15), September

.... [11] and IPP [14] the best performers in the AIPS 98 planning competition [1] see [4] for comparisons) In [8] we began exploring a somewhat different approach, representing not only control rules but also operators, goal statements, and domain constraints using TAL (Temporal Action Logics [7]) a family of narrative based first order temporal logics for reasoning about action and change in incompletely specified dynamic worlds. The resulting planner, TALplanner [8, 25] takes a TAL goal narrative as input and generates a new narrative where a set of TAL action occurrences ....

....action occurrences, dependency constraints, and domain constraints. Second, generate the corresponding theory Delta = Gamma [ Gamma fnd in L(FL) an ordersorted first order language with a linear, discrete time structure. Gamma is the translation of Upsilon into L(FL) using the Trans function [7], and Gamma fnd is a set of foundational axioms including unique names axioms and temporal structure axioms. Third, deal with the well known frame, qualification and ramification problems via a circumscription axiom which is easily reducible to a 1st order formula via syntactic transformation. ....

[Article contains additional citation context not shown here]

P. Doherty, J. Gustafsson, L. Karlsson, and J. Kvarnstrom, `TAL: Temporal Action Logics -- language specification and tutorial', Linkoping Electronic Articles in Computer and Information Science, 3(15), (September 1998). Available at http://www.ep.liu.se/ea/cis/1998/015.

No context found.

P. Doherty, J. Gustafsson, L. Karlsson, and J. Kvarnstrom. Tal: Temporal action logics -- language specification and tutorial. Electronic Transactions on Artificial Intelligence, 3(15), 1998.

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