Filters








132,731 Hits in 2.8 sec

Planning with Effectively Propositional Logic [chapter]

Juan Antonio Navarro-Pérez, Andrei Voronkov
2013 Lecture Notes in Computer Science  
Formulae in this logic can be thought as syntactic sugar on top of the Bernays-Schönfinkel fragment and can, therefore, still be effectively grounded into a propositional representation.  ...  We motivate the study of this logic by showing that practical problems from the area of planning can be naturally and succinctly represented using the added syntactic features.  ...  Furthermore, we also show that reasoning with effectively propositional formulae can be exponentially more efficient than in the propositional setting.  ... 
doi:10.1007/978-3-642-37651-1_13 fatcat:l56zratonvgjxcpo2fcztwwrxy

TouIST: a Friendly Language for Propositional Logic and More

Jorge Fernandez, Olivier Gasquet, Andreas Herzig, Dominique Longin, Emiliano Lorini, Frédéric Maris, Pierre Régnier
2020 Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence  
This work deals with logical formalization and problem solving using automated solvers.  ...  In particular, we show how to use TouIST to solve different classes of planning tasks in Artificial Intelligence.  ...  It is possible to model it in propositional logic, but to obtain a more compact encoding one can use SMT (SAT Modulo Theories) with atoms of QF-LIA (linear arithmetic on integers). 1 In particular we  ... 
doi:10.24963/ijcai.2020/756 dblp:conf/ijcai/FernandezGHLLMR20 fatcat:wk4znvsmnfhbpoxliqc2n4jjim

How Authors Benefit from Linear Logic in the Authoring Process of Interactive Storyworlds [chapter]

Kim Dung Dang, Steve Hoffmann, Ronan Champagnat, Ulrike Spierling
2011 Lecture Notes in Computer Science  
We present a case study of interactive story creation, in which we applied a proof mechanism based on Linear Logic to the authoring process.  ...  After initial scenario modeling for dynamic plot generation based on planning, we used the mechanism in iterations of refinements to find possible problems within a huge possibility space of resulting  ...  Table 1 .Table 2 . 12 Example of an action and its corresponding preconditions and effects. Transformation of an action/event from its planning representation into Linear Logic.  ... 
doi:10.1007/978-3-642-25289-1_27 fatcat:alqaklknsbfgbgpnbk7aemuxou

Parallel Encodings of Classical Planning as Satisfiability [chapter]

Jussi Rintanen, Keijo Heljanko, Ilkka Niemelä
2004 Lecture Notes in Computer Science  
We formalize the semantics of parallel plans emerging in this setting, propose effective translations of these semantics to the classical propositional logic, and show that they yield an approach to classical  ...  proposed outside planning in connection with Petri nets.  ...  Acknowledgements We thank Lawrence Ryan for assistance with the Siege solver.  ... 
doi:10.1007/978-3-540-30227-8_27 fatcat:t2trquaz6fbeffuz4ezwqnemzq

Disjunctive Normal Form for Multi-Agent Modal Logics Based on Logical Separability

Liangda Fang, Kewen Wang, Zhe Wang, Ximing Wen
2019 PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE  
For instance, DNF of propositional logic is tractable for these reasoning tasks.  ...  Modal logics are primary formalisms for multi-agent systems but major reasoning tasks in such logics are intractable, which impedes applications of multi-agent modal logics such as automatic planning.  ...  The main distinction between epistemic planning and traditional planning are that (1) the initial KB and the goal formula are expressed in modal logics other than propositional logics, and (2) the former  ... 
doi:10.1609/aaai.v33i01.33012817 fatcat:4f6dwrvdfnbwtmn5zyt6qmsozy

A Gentle Introduction to Epistemic Planning: The DEL Approach

Thomas Bolander
2017 Electronic Proceedings in Theoretical Computer Science  
Dynamic Epistemic Logic (DEL) has been shown to provide a very natural and expressive framework for epistemic planning.  ...  Epistemic planning can be used for decision making in multi-agent situations with distributed knowledge and capabilities.  ...  Propositional planning tasks Even though STRIPS action schemas are formulated using first-order logic, for most purposes we can consider STRIPS as a planning formalism based on propositional logic.  ... 
doi:10.4204/eptcs.243.1 fatcat:u5e4ep3tnjhnzbaajkobj6v5fe

Complexity, decidability and undecidability results for domain-independent planning

Kutluhan Erol, Dana S. Nau, V.S. Subrahmanian
1995 Artificial Intelligence  
In this paper, we examine how the complexity of domain-independent planning with STRIPSstyle operators depends on the nature of the planning operators.  ...  part of the input to the planning problem, or instead are fixed in advance. l whether or not the operators can have conditional effects.  ...  with conditional effects.  ... 
doi:10.1016/0004-3702(94)00080-k fatcat:rza6bcngmjewtbbsej3wtqjsqy

Refining action theories through abductive logic programming [chapter]

Renwei Li, Luis Moniz Pereira, Veronica Dahl
1998 Lecture Notes in Computer Science  
Reasoning about actions and changes often starts with an action theory which is then used for planning, prediction or explanation.  ...  Then, we present a translation from domain descriptions to abductive logic programs.  ...  We have benefited from discussions with Vladimir Lifschitz in the early stage of this work. We would also like to thank the anonymous referees for their comments on an early version of this paper.  ... 
doi:10.1007/bfb0054793 fatcat:kh2dlmsb4zgmxncetqtrho7sie

PDDL4J: a planning domain description library for java

D. Pellier, H. Fiorino
2017 Journal of experimental and theoretical artificial intelligence (Print)  
Then, we detail the Pddl4j toolkit with an emphasis on the available informative structures, heuristics and search algorithms.  ...  In this article, we present an overview of the Automated Planning concepts and languages. We present some planning systems and their most significant applications.  ...  For simplicity and conciseness, in planning representations, states and actions are usually given in a first order logic language (without function symbols) rather than propositional logic.  ... 
doi:10.1080/0952813x.2017.1409278 fatcat:xwxk6fzjzzayzl22hzo2lawisy

Deductive plan generation [chapter]

Wolfgang Bibel, Michael Thielscher
1994 Lecture Notes in Computer Science  
The problem of classical logic is that propositions are not treated as resources [13] . A proposition cannot be produced and consumed in the course of time. To handle this problem J. McCarthy, P.  ...  The obvious problem with this solution is that the number of frame axioms rapidly increases when many actions and many facts occur. R.  ...  The problem of classical logic is that propositions are not treated as resources [13] . A proposition cannot be produced and consumed in the course of time. To handle this problem J. McCarthy, P.  ... 
doi:10.1007/3-540-58520-6_47 fatcat:fqq54pj74zeutpcezyxprso2cu

Applying integer programming to AI planning

THOMAS VOSSEN, MICHAEL BALL, AMNON LOTEM, DANA NAU
2000 Knowledge engineering review (Print)  
to solve AI planning problems.  ...  This paper provides approaches to encode AI planning problems as IP problems, describes some of the more significant issues that arise in using IP for AI planning, and discusses promising directions for  ...  Encoding a Planning Problem in Propositional Logic Most propositional-logic encodings of planning problems are based on the STRIPS-style planning problems described in Section 2.1, with one important difference  ... 
doi:10.1017/s0269888900001065 fatcat:jizysjn6bfgv5oibtzqno7kg2u

Twist your logic with TouIST [article]

Khaled Skander Ben Slimane, Alexis Comte, Olivier Gasquet, Abdelwahab Heba, Olivier Lezaud, Frederic Maris, Mael Valais
2015 arXiv   pre-print
It can interact with various provers: pure SAT solver but also SMT provers (SAT modulo theories - like linear theory of reals, etc) and thus may also be used by beginners for experiencing with pure propositional  ...  It is devoted to propositional logic and its main features are 1) to offer a high-level logic langage for expressing succintly complex formulas (e.g.\ formulas describing Sudoku rules, planification problems  ...  They teach logic at different levels starting from introductory courses of propositional logic up to advanced topics for graduate students, like modal logic or logic-based planning. S.  ... 
arXiv:1507.03663v1 fatcat:zf554rt6i5gw5bprfomqekkpcm

A PROPOSITION FOR EVALUATION PROCESS OF ITS BY USING A LOGIC MODEL
ロジックモデルを用いたITSの評価プロセスの提案と検証

Kenji OKAMURA, Seigo NASU
2012 Journal of Japan Society of Civil Engineers Ser D3 (Infrastructure Planning and Management)  
As well, Measuring civil awareness with logic model, we suggested a possibility to judge the effectiveness of ITS.  ...  From the results, the connection between a problem structure and an effect structure of ITS were logically explained by a proposed process.  ... 
doi:10.2208/jscejipm.68.i_277 fatcat:ec2hvqtoxbe7nhipcfozdxfevi

Reasoning about action and cooperation

Luigi Sauro, Jelle Gerbrandy, Wiebe van der Hoek, Michael Wooldridge
2006 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems - AAMAS '06  
More precisely, we show how one can combine an action logic which resembles Propositional Dynamic Logic with a cooperation logic which resembles Coalition Logic.  ...  We show how the logic can be obtained in a modularised way, by combining a model for reasoning about actions and their effects with a model that describes what actions an agent can perform.  ...  S To reason about actions and their effect in an SLTS, we use a language that is similar to that of Propositional Dynamic Logic.  ... 
doi:10.1145/1160633.1160663 dblp:conf/atal/SauroGHW06 fatcat:cllelwssxvembfced4p25ccxii

Specification of cooperative constraints in virtual enterprise workflow

A.H.H. Ngu
1999 Proceedings Ninth International Workshop on Research Issues on Data Engineering: Information Technology for Virtual Enterprises. RIDE-VE'99  
We propose using propositional temporal logic for specifying and reasoning over the temporal constraints in workflow's activities and complement it with deontic logic which is used to specify commitments  ...  We demonstrate our specification using a virtual conference planning workflow.  ...  It starts with one of the speech act primitive and ends with an action or a proposition.  ... 
doi:10.1109/ride.1999.758649 dblp:conf/ride/Ngu99 fatcat:t6hr2bjwsrh4tg4g7xg7vfcqqy
« Previous Showing results 1 — 15 out of 132,731 results