Sciweavers

217 search results - page 25 / 44
» A Logic for Approximate First-Order Reasoning
Sort
View
ECSQARU
2001
Springer
14 years 1 hour ago
On Anytime Coherence-Based Reasoning
Abstract. A great deal of research has been devoted to nontrivial reasoning in inconsistent knowledge bases. Coherence-based approaches proceed by a consolidation operation which s...
Frédéric Koriche
WWW
2008
ACM
14 years 8 months ago
Extracting XML schema from multiple implicit xml documents based on inductive reasoning
We propose a method of classifying XML documents and extracting XML schema from XML by inductive inference based on constraint logic programming. The goal of this work is to type ...
Masaya Eki, Tadachika Ozono, Toramatsu Shintani
EPIA
2007
Springer
14 years 1 months ago
Towards Tractable Local Closed World Reasoning for the Semantic Web
Recently, the logics of minimal knowledge and negation as failure MKNF [12] was used to introduce hybrid MKNF knowledge bases [14], a powerful formalism for combining open and clos...
Matthias Knorr, José Júlio Alferes, ...
AAAI
1990
13 years 8 months ago
An Approach to Reasoning About Continuous Change for Applications in Planning
There are many planning applications that require an agent to coordinate its activities with processes that change continuously over time. Several proposals have been made for com...
Thomas Dean, Greg Siegle
ICLP
2010
Springer
13 years 11 months ago
Improving the Efficiency of Gibbs Sampling for Probabilistic Logical Models by Means of Program Specialization
Abstract. There is currently a large interest in probabilistic logical models. A popular algorithm for approximate probabilistic inference with such models is Gibbs sampling. From ...
Daan Fierens