Sciweavers

153 search results - page 8 / 31
» Warrant without truth
Sort
View
115
Voted
LPNMR
1993
Springer
15 years 4 months ago
Negation as Partial Failure
We present a logic programming language which uses a four-valued bilattice as the underlying framework for semantics of programs. The two orderings of the bilattice reflect the c...
Bamshad Mobasher, Jacek Leszczylowski, Don Pigozzi
AAAI
1990
15 years 1 months ago
Exploiting Locality in a TMS
This paper presents a new approach for exploiting Truth Maintenance Systems(TMSs) which makes them simpler to use without necessarily incurring a substantial performance penalty. ...
Johan de Kleer
89
Voted
SIGECOM
2004
ACM
120views ECommerce» more  SIGECOM 2004»
15 years 6 months ago
Computational criticisms of the revelation principle
The revelation principle is a cornerstone tool in mechanism design. It states that one can restrict attention, without loss in the designer’s objective, to mechanisms in which A...
Vincent Conitzer, Tuomas Sandholm
ICALP
1998
Springer
15 years 5 months ago
Difficult Configurations - On the Complexity of LTrL
The complexity of LTrL, a global linear time temporal logic over traces is investigated. The logic is global because the truth of a formula is evaluated in a global state, also ca...
Igor Walukiewicz
94
Voted
DAGSTUHL
2007
15 years 2 months ago
Incentive Compatible Regression Learning
We initiate the study of incentives in a general machine learning framework. We focus on a game-theoretic regression learning setting where private information is elicited from mu...
Ofer Dekel, Felix A. Fischer, Ariel D. Procaccia