Sciweavers

835 search results - page 34 / 167
» Nonmonotonic Reasoning in Probabilistics
Sort
View
ESWS
2006
Springer
13 years 11 months ago
Matching Semantic Service Descriptions with Local Closed-World Reasoning
Abstract. Semantic Web Services were developed with the goal of automating the integration of business processes on the Web. The main idea is to express the functionality of the se...
Stephan Grimm, Boris Motik, Chris Preist
TKDE
2010
164views more  TKDE 2010»
13 years 5 months ago
Defeasible Contextual Reasoning with Arguments in Ambient Intelligence
Abstract—The imperfect nature of context in Ambient Intelligence environments and the special characteristics of the entities that possess and share the available context informa...
Antonis Bikakis, Grigoris Antoniou
SAT
2010
Springer
178views Hardware» more  SAT 2010»
13 years 11 months ago
Proof Complexity of Propositional Default Logic
Default logic is one of the most popular and successful formalisms for non-monotonic reasoning. In 2002, Bonatti and Olivetti introduced several sequent calculi for credulous and s...
Olaf Beyersdorff, Arne Meier, Sebastian Mülle...
CL
2000
Springer
13 years 7 months ago
A New Equational Foundation for the Fluent Calculus
Abstract. A new equational foundation is presented for the Fluent Calculus, an established predicate calculus formalism for reasoning about actions. We discuss limitations of the e...
Hans-Peter Störr, Michael Thielscher
FGCS
1992
107views more  FGCS 1992»
13 years 8 months ago
Logic Programming, Abduction and Probability
Probabilistic Horn abduction is a simple framework to combine probabilistic and logical reasoning into a coherent practical framework. The numbers can be consistently interpreted ...
David Poole