Sciweavers

319 search results - page 51 / 64
» Uncertainty Reasoning in Description Logics: A Generic Appro...
Sort
View
CADE
2011
Springer
12 years 8 months ago
Experimenting with Deduction Modulo
Deduction modulo is a generic framework to describe proofs in a theory better than using raw axioms. This is done by presenting the theory through rules rewriting terms and proposi...
Guillaume Burel
CORR
2004
Springer
151views Education» more  CORR 2004»
13 years 8 months ago
Finite-Tree Analysis for Constraint Logic-Based Languages: The Complete Unabridged Version
Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occ...
Roberto Bagnara, Roberta Gori, Patricia M. Hill, E...
KR
1998
Springer
14 years 29 days ago
Combining Narratives
A theory is elaboration tolerant to the extent that new information can be incorporated with only simple changes. The simplest change is conjoining new information, and only conju...
John McCarthy, Tom Costello
ARTS
1999
Springer
14 years 1 months ago
Specifying Performance Measures for PEPA
Stochastic process algebras such as PEPA provide ample support for the component-based construction of models. Tools compute the numerical solution of these models; however, the st...
Graham Clark, Stephen Gilmore, Jane Hillston
ADBIS
2006
Springer
135views Database» more  ADBIS 2006»
14 years 15 days ago
Interactive Discovery and Composition of Complex Web Services
Among the most important expected benefits of a global service oriented architecture leveraging web service standards is an increased level of automation in the discovery, composit...
Sergey A. Stupnikov, Leonid A. Kalinichenko, St&ea...