AAAI
2000
14 years 1 months ago
2000
Many problem-solving tasks can be formalized as constraint satisfaction problems (CSPs). In a multi-agent setting, information about constraints and variables may belong to differ...
AAAI
1998
14 years 1 months ago
1998
Abstract. Recent work on search has identified an intriguing feature dubbed the constrainedness knife-edge by Walsh (Proc. AAAI98, 406
AAAI
1998
14 years 1 months ago
1998
Production planning is an important task in manufacturing systems. We consider a real-world capacitated lot-sizing problem (CLSP) from the process industry. Because the problem re...
AAAI
2000
14 years 1 months ago
2000
We introduce new linear time algorithms for satisfiability of binary propositional theories (2-SAT), and for recognition and satisfiability of renamable Horn theories. The algorit...
AAAI
1998
14 years 1 months ago
1998
For mobile robots to assist people in everyday life, they must be easy to instruct. This paper describes a gesture-based interface for human robot interaction, which enables peopl...
AAAI
1998
14 years 1 months ago
1998
AAAI
2000
14 years 1 months ago
2000
In this paper, we consider a method of computing minimal models in circumscription using integer programming in propositional logic and first-order logic with domain closure axiom...
AAAI
2000
14 years 1 months ago
2000
Combinatorial auctions can be used to reach efficient resource and task allocations in multiagent systems where the items are complementary. Determining the winners is NP-complete...
AAAI
1998
14 years 1 months ago
1998
AAAI
2000
14 years 1 months ago
2000
We present a general algorithm for synthesizing state invariants that speed up automated planners and have other applications in reasoning about change. Invariants are facts that ...