A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
In this work we investigate the use of propositional linear temporal logic LTL as a speci cation language for planning problems and the use of analytic tableaux as a tool for plan search, following the ... We propose the use of Tabplan, a tableau calculus for bounded model search in LTL (fully described in 7]), as a system for plan synthesis. ... Bounded Model Construction in LTL We consider the full language of propositional linear temporal logic. ...doi:10.1007/bfb0057441 fatcat:ehnvlatnqrhyvfh46i7xeoznzm
Sean (1-GMSN-ISF; Fairfax, VA); Jajodia, Sushil (1-GMSN-ISF; Fairfax, VA) A general framework for time granularity and its application to temporal reasoning. ... Goals of this form are limited in what they can specify, and they also do not allow us to constrain the manner in which the plan achieves its objectives. ...
In this paper we describe the logic, the automated deduction system, and an application to robotics. ... The graphical user interface enables the user to create Graphical Interval Logic formulas and proofs on a workstation display, and the theorem prover checks the validity of deductions in the logic. ... If temporal logics are to become more widely used in planning and system design, a logic must be found that is easier to use and understand. ...doi:10.1080/11663081.1996.10510865 fatcat:p4z2ltt65jawnf3v3yddk6vqcq
verified against properties expressed in temporal logic. ... The input domain of the program is explored using a model checker extended with symbolic execution. Properties are formulated in an expressive temporal logic. ... based on regular (and extended regular) expressions, to a whole host of modal and, in particular, linear-time temporal logics (LTL). ...doi:10.1016/j.tcs.2004.11.007 fatcat:kmfeguv4zjcm3ky7bnuusna4e4
Our main goal is to define a semantically wellfounded logic for approximate reasoning, which is justifiable from the intuitive point of view, and to provide fast algorithms for dealing with it even when ... Tractable reasoning via approximation Problems in logic are well-known to be hard to solve in the worst case. ... Such disjunctions add a great deal of expressive power, including the ability to stipulate disjointness of temporal intervals, which is important in planning applications. ...doi:10.1016/0004-3702(95)90010-1 fatcat:afhan6uvwffxzitrp7wnajfchm
Lecture Notes in Computer Science
The linear temporal logic  has been used to model such systems  , and even as the foundation for a multirobot programming environment  . ... In order to ensure that the scope of the resulting search remains bounded, I plan to require that the replication be bounded within minimum and maximum values. ...doi:10.1007/978-3-642-02846-5_62 fatcat:xcscshvvyjdp7meaybsd7zl4oq
These alternatives are presented in connection with three different applications of model checking: verification, plan synthesis as well as heuristic guidance of AI planning, and controller synthesis. ... We include results from benchmarks obtained from preparatory experiments with model checking using a family of LTL2Büchi translators and formula progression. ... Linear Temporal Logic We use LTL with bounded quantification. ...doi:10.1016/j.entcs.2005.07.028 fatcat:ddzuwe6sbrbx7mp5x7zcruccbm
In the last decade, significant advances have been made in the synthesis of programs from specifications expressed in Linear Temporal Logic (LTL). ... LTL synthesis technology is central to a myriad of applications from the automated generation of controllers for Internet of Things devices, to the synthesis of control software for robotic applications ... In the context of constructing strategies for reactive systems, Pnueli and Rosner  proposed Linear Temporal Logic (LTL) synthesis where the specification is expressed in LTL. ...doi:10.24963/ijcai.2018/848 dblp:conf/ijcai/CamachoMBM18a fatcat:4vxwdcpb7fbibnzzdz6nnuehny
Walser, Ramesh Iyer and Narayan Venkatasubramanyan, An integer local search method with application to capacitated production planning (373-379); Jason H. Y. ... and Feng Zhao, Qual- itative analysis of distributed physical systems with applications to control synthesis (232-239); Daniel J. ...
We present the basic logical methods with some examples of their applications, and plan to publish in a subsequent paper in this journal some modifications of the tools and a description of their application ... This bound is linear with respect to the height of the terms in the original problem. ...
In this paper, we present an optimization based method for path planning of a mobile robot subject to time bounded temporal constraints, in a dynamic environment. ... We use metric temporal logic (MTL) to encode the task specifications with timing constraints. ... Mixed Integer Linear Constraints In this section, we demonstrate our approach to translate a time-bounded temporal logic formula to linear constraints on state variables and inputs. ...doi:10.1109/ecc.2015.7330634 dblp:conf/eucc/ZhouMB15 fatcat:p7ll3rcl2fgbdlkmu53b5uysga
Furthermore, we use state-of-the-art planners, including an existing one and a self-developed one, to handle complex temporal planning problems with logical reasoning and numerical optimization. ... In this paper, instead of predefining a workflow model for service composition, we propose a novel planning-based approach that can automatically convert a QoS-aware composition task to a planning problem ... In this application  ,  , a Status and Action Management (SAM) model was developed to employ planning in a real-time BPM process modeling environment, SAP NetWeaver platform. ...doi:10.1109/tsc.2012.27 fatcat:wwkodtru4bf5viiucvsnn4tspu
UAM missions with complex spatial, temporal and reactive requirements can be succinctly represented using Signal Temporal Logic (STL), a behavioral specification language. ... However, planning and control of systems with STL specifications is computationally intensive, usually resulting in planning approaches that do not guarantee dynamical feasibility, or control approaches ... It is hard to capture these requirements with the objectives used in traditional control and planning approaches, however recent work on planning and control with Signal Temporal Logic (STL)  - [3 ...arXiv:2009.14363v1 fatcat:vpjnravrgret3e6hx6fzhhcavi
Lecture Notes in Computer Science
This paper presents a formal framework which can be used to model such systems and proposes the use of formally-modeled agents' preferences as a way of reducing the number of states. ... Automated planning for numerous co-existing agents, with uncertainty caused by various levels of their predictability, observability and autonomy, is a complex task. ... It exists in many varieties; however, considerations in this paper are limited to the Linear Temporal Logic LTL, i.e. logic for which the time structure is considered linear. ...doi:10.1007/978-3-642-38610-7_34 fatcat:rgnhsmy2rzfqphyawfbzzqgxu4
To reduce the overhead in resolving such global constraints, we develop in this paper new conditions and algorithms for limiting the search space to be backtracked in each subproblem. ... In this paper, we study the partitioning of constraints in temporal planning problems formulated as mixed-integer nonlinear programming (MINLP) problems. ... We want to show that these models can be used successfully in controlling the execution of a plan. ...doi:10.1016/j.artint.2005.10.015 fatcat:7sswomco75efrm4xo3e573t7xi
« Previous Showing results 1 — 15 out of 30,690 results