Sciweavers

3658 search results - page 135 / 732
» The logic of proofs, semantically
Sort
View
88
Voted
COMMA
2006
15 years 2 months ago
Semi-Stable Semantics
In this paper, we examine an argument-based semantics called semi-stable semantics. Semi-stable semantics is quite close to traditional stable semantics in the sense that every st...
Martin Caminada
116
Voted
WADT
2004
Springer
15 years 6 months ago
Type Class Polymorphism in an Institutional Framework
Higher-order logic with shallow type class polymorphism is widely used as a specification formalism. Its polymorphic entities (types, operators, axioms) can easily be equipped wit...
Lutz Schröder, Till Mossakowski, Christoph L&...
ECSQARU
2007
Springer
15 years 6 months ago
An Algorithm for Computing Inconsistency Measurement by Paraconsistent Semantics
Measuring inconsistency in knowledge bases has been recognized as an important problem in many research areas. Most of approaches proposed for measuring inconsistency are based on ...
Yue Ma, Guilin Qi, Pascal Hitzler, Zuoquan Lin
96
Voted
WWW
2006
ACM
16 years 1 months ago
Position paper: a comparison of two modelling paradigms in the Semantic Web
Classical logics and Datalog-related logics have both been proposed as underlying formalisms for the Semantic Web. Although these two different formalism groups have some commonal...
Peter F. Patel-Schneider, Ian Horrocks
CAV
2006
Springer
143views Hardware» more  CAV 2006»
15 years 4 months ago
Automatic Termination Proofs for Programs with Shape-Shifting Heaps
We describe a new program termination analysis designed to handle imperative programs whose termination depends on the mutation rogram's heap. We first describe how an abstrac...
Josh Berdine, Byron Cook, Dino Distefano, Peter W....