TABLEAUX
1999
Springer
14 years 17 hour ago
1999
Springer
We combine techniques originally developed for refutational first-order theorem proving within the clause tree framework with techniques for minimal model computation developed wi...
TABLEAUX
1999
Springer
14 years 17 hour ago
1999
Springer
Abstract. We define sequent-style calculi for nominal tense logics characterized by classes of modal frames that are first-order definable by certain Π0 1 -formulae and Π0 2 -...
PRICAI
1999
Springer
14 years 20 hour ago
1999
Springer
The optimal decision for an agent to make at a given game situation often depends on the decisions that other agents make at the same time. Rational agents will try to find a stabl...
PRICAI
1999
Springer
14 years 20 hour ago
1999
Springer
Abstract. In multi-agent reinforcement learning systems, it is important to share a reward among all agents. We focus on the Rationality Theorem of Profit Sharing [5] and analyze ...
KI
1999
Springer
14 years 1 days ago
1999
Springer
Among the formalisms for qualitative spatial reasoning, the Region Connection Calculus and its variant, the constraint algebra RCC8, have received particular attention recently. A...
KI
1999
Springer
14 years 1 days ago
1999
Springer
Computing least common subsumers in description logics is an important reasoning service useful for a number of applications. As shown in the literature, it can, for instance, be u...
KI
1999
Springer
14 years 1 days ago
1999
Springer
Abstract. Due to its prominence in artificial intelligence and theoretical computer science, the propositional satisfiability problem (SAT) has received considerable attention in...
KI
1999
Springer
14 years 1 days ago
1999
Springer
KI
1999
Springer
14 years 1 days ago
1999
Springer
KI
1999
Springer
14 years 1 days ago
1999
Springer