Sciweavers

8413 search results - page 297 / 1683
» Ordering Problem Subgoals
Sort
View
DAGSTUHL
2007
15 years 8 months ago
Implementing RPO and POLO using SAT
Abstract. Well-founded orders are the most basic, but also most important ingredient to virtually all termination analyses. Numerous fully automated search algorithms for these cla...
Peter Schneider-Kamp, Carsten Fuhs, René Th...
IJOE
2008
120views more  IJOE 2008»
15 years 6 months ago
Application of the Control Validation to the D.E.S. Teaching
Objectives of Automation courses are knowledge and know-how transfer to students. It is important for learner to control locally or remotely real systems composed of many sensors a...
Pascale Marange, François Gellot, Bernard R...
AI
2004
Springer
15 years 6 months ago
On the revision of preferences and rational inference processes
Orderings and inference relations can be successfully used to model the behavior of a rational agent. This behavior is indeed represented either by a set of ordered pairs that ref...
Michael Freund
CAP
2010
15 years 1 months ago
Parallel disk-based computation for large, monolithic binary decision diagrams
Binary Decision Diagrams (BDDs) are widely used in formal verification. They are also widely known for consuming large amounts of memory. For larger problems, a BDD computation wi...
Daniel Kunkle, Vlad Slavici, Gene Cooperman
IJCAI
1989
15 years 7 months ago
Towards a Theory of Conflict Detection and Resolution in Nonlinear Plans
This paper deals with a well known problem in AI planning: detecting and resolving conflicts in nonlinear plans. We sketch a theory of restricted conflict detection and resolution...
Joachim Hertzberg, Alexander Horz