Sciweavers

1404 search results - page 177 / 281
» Complexity of admissible rules
Sort
View
PUK
2000
13 years 10 months ago
On the Instantiation of ADL Operators Involving Arbitrary First-Order Formulas
The generation of the set of all ground actions for a given set of ADL operators, which are allowed to have conditional effects and preconditions that can be represented using arbi...
Jana Koehler, Jörg Hoffmann
AAAI
1994
13 years 10 months ago
Small is Beautiful: A Brute-Force Approach to Learning First-Order Formulas
We describe a method for learning formulas in firstorder logic using a brute-force, smallest-first search. The method is exceedingly simple. It generates all irreducible well-form...
Steven Minton, Ian Underwood
AIPS
1996
13 years 10 months ago
A Procedural Knowledge Approach to Task-Level Control
Effective task-level control is critical for robots that are to engage in purposeful activity in realworld environments. This paper describes PRSLite, a task-level controller grou...
Karen L. Myers
DAGSTUHL
1996
13 years 10 months ago
An Automatic Interprocedural Analysis for the Understanding of Scientific Application Programs
This paper reports on an approachfor improvingthe understandingof old programs which have become very complex due to numerous extensions. We have adapted partial evaluation techni...
Sandrine Blazy, Philippe Facon
DEDUCTIVE
1994
119views Database» more  DEDUCTIVE 1994»
13 years 10 months ago
Determining Correct View Update Translations via Query Containment
Given an intensional database (IDB) and an extension database (EDB), the view update problem translates updates on the IDB into updates on the EDB. One approach to the view update...
Anthony Tomasic