Sciweavers

496 search results - page 86 / 100
» Practical Reasoning for Very Expressive Description Logics
Sort
View
CONCUR
2005
Springer
15 years 3 months ago
Deriving Weak Bisimulation Congruences from Reduction Systems
The focus of process calculi is interaction rather than computation, and for this very reason: (i) their operational semantics is conveniently expressed by labelled transition syst...
Roberto Bruni, Fabio Gadducci, Ugo Montanari, Pawe...
CBMS
2006
IEEE
15 years 3 months ago
Incoporating Data Mining Applications into Clinical Guildelines
Computer based clinical guidelines have been developed to help caregivers in practicing medicine. GLIF3 (Guideline Interchange Format 3) is one of several standards that specify t...
Reza Sherafat Kazemzadeh, Kamran Sartipi
JODS
2008
123views Data Mining» more  JODS 2008»
14 years 9 months ago
A Fine-Grained Approach to Resolving Unsatisfiable Ontologies
The ability to deal with inconsistencies and to evaluate the impact of possible solutions for resolving inconsistencies are of the utmost importance in real world ontology applicat...
Joey Sik Chun Lam, Derek H. Sleeman, Jeff Z. Pan, ...
AAAI
1990
14 years 10 months ago
The Representation of Defaults in Cyc
This paper provides an account of the representation of defaults in Cyc and their semantics in terms of first order logic with reification. Default reasoning is a complex thing, a...
Ramanathan V. Guha
73
Voted
GLVLSI
2009
IEEE
150views VLSI» more  GLVLSI 2009»
15 years 4 months ago
Contradictory antecedent debugging in bounded model checking
In the context of formal verification Bounded Model Checking (BMC) has shown to be very powerful for large industrial designs. BMC is used to check whether a circuit satisfies a...
Daniel Große, Robert Wille, Ulrich Kühn...