Sciweavers

13090 search results - page 2366 / 2618
» Usable artificial intelligence
Sort
View
LPNMR
2009
Springer
16 years 1 months ago
Casting Away Disjunction and Negation under a Generalisation of Strong Equivalence with Projection
Abstract. In answer-set programming (ASP), many notions of program equivalence have been introduced and formally analysed. A particular line of research in this direction aims at s...
Jörg Pührer, Hans Tompits
LPNMR
2009
Springer
16 years 1 months ago
The Complexity of Circumscriptive Inference in Post's Lattice
Circumscription is one of the most important formalisms for reasoning with incomplete information. It is equivalent to reasoning under the extended closed world assumption, which a...
Michael Thomas
LPNMR
2009
Springer
16 years 1 months ago
Relevance-Driven Evaluation of Modular Nonmonotonic Logic Programs
Modular nonmonotonic logic programs (MLPs) under the answer-set semantics have been recently introduced as an ASP formalism in which modules can receive context-dependent input fro...
Minh Dao-Tran, Thomas Eiter, Michael Fink, Thomas ...
TARK
2009
Springer
16 years 1 months ago
Contractual traps
In numerous economic scenarios, contracting parties may not have a clear picture of all the relevant aspects. While confronted with these unawareness issues, the strategic decisio...
Ying-Ju Chen, Xiaojian Zhao
TARK
2009
Springer
16 years 1 months ago
Program equilibria and discounted computation time
Tennenholtz (GEB 2004) developed Program Equilibrium to model play in a finite twoplayer game where each player can base their strategy on the other player’s strategies. Tennen...
Lance Fortnow
« Prev « First page 2366 / 2618 Last » Next »