Book ChapterDOI
A System-Theoretic Approach to Planning and Programming
Ireneusz Sierocki
- pp 117-128
Reads0
Chats0
TLDR
It is shown that a solution to the multiple planning problem can be written in procedural (imperative) languages like Pascal and it is proven that a multiple plan can be generated by a conditional-iterative action.Abstract:
This paper deals with a multiple planning problem, which is a collection of planning problems defined for the same partial transition system and have the same set of goal states. It is shown that a solution to the multiple planning problem can be written in procedural (imperative) languages like Pascal. The formal definition of the syntax and semantics of conditional-iterative actions is provided. It is proven that a multiple plan can be generated by a conditional-iterative action. A language of formal representation of partial transition systems with a vector-state space is proposed.read more
Citations
More filters
A New Logical Framework for deductive Planning.
Werner Stephan,Susanne Biundo +1 more
TL;DR: A logical framework for defining consistent axiomatizations of planning domains and a tactical theorem prover, the Karlsruhe Interactive Verifier KIV is used to implement this logical framework.
References
More filters
Book
Principles of Artificial Intelligence
TL;DR: This classic introduction to artificial intelligence describes fundamental AI ideas that underlie applications such as natural language processing, automatic programming, robotics, machine vision, automatic theorem proving, and intelligent data retrieval.
Book
Systematic software development using VDM
TL;DR: Logic of propositions reasoning about predicates functions and operations set notation composite objects and invariants map notation sequence notation data rectification more on data types operation decomposition.
Book
Logical Foundations of Artificial Intelligence
TL;DR: Typographical Conventions 1 Introduction 1 Bibliographical and Historical Remarks Exercises 2 Declarative Knowledge 2.1 Conceptualization 2.2 Predicate Calculus 2.3 Semantics 2.4 Blocks World Example 2.5 Circuits 2.6 Algebraic Examples 2.7 List Examples 1.9 Specialized Languages 2.8 Reasoning with Uncertain Reasoning 3.1 Probabilities of Sentences 3.4 Provability 3.5 Proving Provability
Book
Switching and Finite Automata Theory
Zvi Kohavi,Niraj K. Jha +1 more
TL;DR: Theories are made easier to understand with 200 illustrative examples, and students can test their understanding with over 350 end-of-chapter review questions.