13 search results - page 2 / 3 » A Note on Transitive Sets without the Foundation Axiom |
ASM
2004
ASM
15 years 5 months ago
2004
ASM
Consider a multiple-agent transition system such that, for some basic types T1, . . . , Tn, the state of any agent can be represented as an element of the Cartesian product T1 ×·...
114
click to vote
ML
2008
ACM
14 years 11 months ago
2008
ACM
It is well-known that heuristic search in ILP is prone to plateau phenomena. An explanation can be given after the work of Giordana and Saitta: the ILP covering test is NP-complete...
107
click to vote
DLOG
2011
14 years 3 months ago
2011
We study a restriction of the classification procedure for EL++ where the inference rule for complex role inclusion axioms (RIAs) is applied in a “left-linear” way in analogy ...
197
click to vote
POPL
2005
ACM
15 years 12 months ago
2005
ACM
on Predicate Abstraction and Fair Termination Andreas Podelski Andrey Rybalchenko Max-Planck-Institut f?ur Informatik Saarbr?ucken, Germany Predicate abstraction is the basis of m...
SYNTHESE
2008
14 years 11 months ago
2008
This article goes to the foundations of Statistical Inference through a review of Carnap's logic theory of induction. From this point of view, it brings another solution to t...