Sciweavers

IJCAI
1993
13 years 5 months ago
A Computational Model of Tractable Reasoning - Taking Inspiration from Cognition
Polynomial time complexity is the usual ‘threshold’ for distinguishing the tractable from the intractable and it may seem reasonable to adopt this notion of tractability in th...
Lokendra Shastri
UAI
1998
13 years 5 months ago
Learning From What You Don't Observe
The process of diagnosis involves learning about the state of a system from various observations of symptoms or findings about the system. Sophisticated Bayesian (and other) algor...
Mark A. Peot, Ross D. Shachter
ICLP
2010
Springer
13 years 8 months ago
Dynamic Magic Sets for Disjunctive Datalog Programs
Abstract. Answer set programming (ASP) is a powerful formalism for knowledge representation and common sense reasoning that allows disjunction in rule heads and nonmonotonic negati...
Mario Alviano
ECAI
1994
Springer
13 years 8 months ago
Reasoning by Cases without Contraposition in Default Logic
Default logic, one of the best known formalisms to express common sense reasoning, does not allow to reason by cases in its standard formulations. We propose a natural and easy way...
Yves Moinard