<--- Back to Details
First PageDocument Content
Philosophy / American philosophers / Automated planning and scheduling / Hierarchical task network / Partial-order planning / Kurt Gdel / Logic programming / Godel
Date: 2013-04-23 16:45:47
Philosophy
American philosophers
Automated planning and scheduling
Hierarchical task network
Partial-order planning
Kurt Gdel
Logic programming
Godel

The GoDeL Planning System: A More Perfect Union of Domain-Independent and Hierarchical Planning Vikas Shivashankar1 Ron Alford1 Ugur Kuter2 Dana Nau1

Add to Reading List

Source URL: www.cs.umd.edu

Download Document from Source Website

File Size: 296,52 KB

Share Document on Facebook

Similar Documents

2009 Godel Prize  The 2009 G¨odel Prize for outstanding papers in the area of theoretical computer science is awarded to (1) Entropy waves, the zig-zag graph product and new constant degree expanders, Omer Reingold, Sal

2009 Godel Prize The 2009 G¨odel Prize for outstanding papers in the area of theoretical computer science is awarded to (1) Entropy waves, the zig-zag graph product and new constant degree expanders, Omer Reingold, Sal

DocID: 1vbKk - View Document

Characterization of the Axiomatizable Prenex Fragments of First-Order Gödel Logics Matthias Baaz∗ Technische Universität Wien A–1040 Vienna, Austria

Characterization of the Axiomatizable Prenex Fragments of First-Order Gödel Logics Matthias Baaz∗ Technische Universität Wien A–1040 Vienna, Austria

DocID: 1uUXp - View Document

¨ GODEL’S REFORMULATION OF GENTZEN’S FIRST CONSISTENCY PROOF FOR ARITHMETIC: THE NO-COUNTEREXAMPLE INTERPRETATION

¨ GODEL’S REFORMULATION OF GENTZEN’S FIRST CONSISTENCY PROOF FOR ARITHMETIC: THE NO-COUNTEREXAMPLE INTERPRETATION

DocID: 1u3KT - View Document

Logic and the Methodology of Science June 2003 Preliminary Exam August 23, Let L be a finite first-order language whose formulae have been Godel numbered in some natural way. Let Sat be the set of all (Godel numb

Logic and the Methodology of Science June 2003 Preliminary Exam August 23, Let L be a finite first-order language whose formulae have been Godel numbered in some natural way. Let Sat be the set of all (Godel numb

DocID: 1u2Wk - View Document

What is Gödel’s Second Incompleteness Theorem ??? Introductory Remarks

What is Gödel’s Second Incompleteness Theorem ??? Introductory Remarks

DocID: 1u06S - View Document