49 search results - page 2 / 10 » MaLARea: a Metasystem for Automated Reasoning in Large Theor... |
ATAL
2011
Springer
12 years 5 months ago
2011
Springer
We develop an algorithm for opponent modeling in large extensive-form games of imperfect information. It works by observing the opponent’s action frequencies and building an opp...
ECSQARU
2001
Springer
13 years 10 months ago
2001
Springer
Abstract. Consistency-based approaches in nonmonotonic reasoning may be expected to yield multiple sets of default conclusions for a given default theory. Reasoning about such exte...
IJCAI
1997
13 years 7 months ago
1997
In the paper, we consider the problem of supporting automated reasoning in a large class of knowledge representation formalisms, including terminological and epistemic logics, who...
CADE
2008
Springer
14 years 6 months ago
2008
Springer
Abstract. We implement an algorithm for extracting appropriate collections of classic-like sound and complete tableaux rules for a large class of finite-valued logics. Its output c...
CADE
2007
Springer
14 years 6 months ago
2007
Springer
Much research concerning Satisfiability Modulo Theories is devoted to the design of efficient SMT-solvers that integrate a SATsolver with T -satisfiability procedures. The rewrite-...