Sciweavers

256 search results - page 8 / 52
» An Implementation for Abductive Logic Agents
Sort
View
AAAI
2000
13 years 9 months ago
The Complexity of Restricted Consequence Finding and Abduction
We analyze the complexity of propositional kernel resolution (del Val 1999), a general method for obtaining logical consequences in restricted target languages. Different choices ...
Alvaro del Val
RR
2010
Springer
13 years 6 months ago
A Probabilistic Abduction Engine for Media Interpretation Based on Ontologies
For multimedia interpretation, and in particular for the combined interpretation of information coming from different modalities, a semantically well-founded formalization is requ...
Oliver Gries, Ralf Möller, Anahita Nafissi, M...
ECP
1997
Springer
102views Robotics» more  ECP 1997»
13 years 11 months ago
Event Calculus Planning Revisited
In 1969 Cordell Green presented his seminal description of planning as theorem proving with the situation calculus. The most pleasing feature of Green's account was the negli...
Murray Shanahan
IAT
2009
IEEE
14 years 2 months ago
Computing Information Minimal Match Explanations for Logic-Based Matchmaking
Abstract—In semantic matchmaking processes it is often useful, when the obtained match is not full, to provide explanations for the mismatch, to leverage further interaction and/...
Tommaso Di Noia, Eugenio Di Sciascio, Francesco M....