<--- Back to Details
First PageDocument Content
Finite automata / Timed automaton / Logic in computer science / Automated planning and scheduling / Fluent / Finite-state machine / Theoretical computer science / Planning Domain Definition Language / Models of computation
Date: 2015-02-02 08:45:53
Finite automata
Timed automaton
Logic in computer science
Automated planning and scheduling
Fluent
Finite-state machine
Theoretical computer science
Planning Domain Definition Language
Models of computation

Microsoft Word - IBSAlgorithms.doc

Add to Reading List

Source URL: foibg.com

Download Document from Source Website

File Size: 150,67 KB

Share Document on Facebook

Similar Documents

Probability / Amyloidosis / Logic / Formal epistemology / Non-classical logic / Probabilistic logic / Automated planning and scheduling / PRNP / Markov decision process / Planning Domain Definition Language / PP

From FOND to Probabilistic Planning: Guiding search for quality policies Alberto Camacho† , Christian Muise∗ , Akshay Ganeshen† , Sheila A. McIlraith† † Department of Computer Science, University of Toronto Dep

DocID: 1rboJ - View Document

Theoretical computer science / Automated planning and scheduling / Logic in computer science / Mathematics / Computational complexity theory / Boolean algebra / Electronic design automation / Formal methods / Boolean satisfiability problem / Maximum satisfiability problem / Planning Domain Definition Language / Satz

An experimental evaluation of Max-SAT and PB solvers on over-subscription planning problems Marco Maratea DIST, University of Genova, Viale F. Causa 15, Genova, Italy. Abstract

DocID: 1qYdf - View Document

Finite automata / Timed automaton / Logic in computer science / Automated planning and scheduling / Fluent / Finite-state machine / Theoretical computer science / Planning Domain Definition Language / Models of computation

Microsoft Word - IBSAlgorithms.doc

DocID: 1qBzD - View Document

Theoretical computer science / Mathematical logic / Mathematics / Logic in computer science / Boolean algebra / Logic programming / Automated planning and scheduling / Formal methods / Situation calculus / Planning Domain Definition Language / Boolean satisfiability problem / Conjunctive normal form

Learning Partially Observable Action Models: Efficient Algorithms Dafna Shahaf Allen Chang Eyal Amir Computer Science Department University of Illinois, Urbana-Champaign Urbana, IL 61801, USA {dshahaf2,achang6,eyal}@uiuc

DocID: 1qzAi - View Document

Amyloidosis / Philosophy / Cognitive science / Automated planning and scheduling / Planning Domain Definition Language / PRNP / Neuropsychology / Causality / Economic model / Algorithm / Planning

Non-Deterministic Planning With Conditional Effects Christian Muise and Sheila A. McIlraith and Vaishak Belle Department of Computer Science University of Toronto, Toronto, Canada. {cjmuise,sheila,vaishak}@cs.toronto.edu

DocID: 1qkW7 - View Document