580 search results - page 102 / 116 » On the Foundations of Answer Set Programming |
133
click to vote
NMR
2004
Springer
15 years 9 months ago
2004
Springer
This paper presents a computational model for reasoning with causal explanations of observations within the framework of Abductive Event Calculus (AEC). The model is based on abdu...
154
Voted
AGP
2003
IEEE
15 years 9 months ago
2003
IEEE
Abstract The Semantic Web (SW) can be seen as abstract representation and exchange of data and metadata. Metadata is given in terms of data mark-up and reference to shared, Web-acc...
102
click to vote
EPIA
1999
Springer
15 years 8 months ago
1999
Springer
YapOr is an or-parallel system that extends the Yap Prolog system to exploit implicit or-parallelism in Prolog programs. It is based on the environment copying model, as first imp...
144
Voted
ICALP
1995
Springer
15 years 7 months ago
1995
Springer
An infinite binary sequence x is defined to be (i) strongly useful if there is a computable time bound within which every decidable sequence is Turing reducible to x; and (ii) w...
154
click to vote
AAAI
2007
15 years 6 months ago
2007
Generality or refinement relations between different theories have important applications to generalization in inductive logic programming, refinement of ontologies, and coordin...