Sciweavers

LICS
2002
IEEE
14 years 4 months ago
Semantic Subtyping
Alain Frisch, Giuseppe Castagna, Véronique ...
LICS
2002
IEEE
14 years 4 months ago
Remarks on Isomorphisms in Typed Lambda Calculi with Empty and Sum Types
Tarski asked whether the arithmetic identities taught in high school are complete for showing all arithmetic equations valid for the natural numbers. The answer to this question f...
Marcelo P. Fiore, Roberto Di Cosmo, Vincent Balat
LICS
2002
IEEE
14 years 4 months ago
The Metric Analogue of Weak Bisimulation for Probabilistic Processes
We observe that equivalence is not a robust concept in the presence of numerical information - such as probabilities - in the model. We develop a metric analogue of weak bisimulat...
Josee Desharnais, Radha Jagadeesan, Vineet Gupta, ...
LICS
2002
IEEE
14 years 4 months ago
Description Logics: Foundations for Class-based Knowledge Representation
Diego Calvanese, Giuseppe De Giacomo, Maurizio Len...
LICS
2002
IEEE
14 years 4 months ago
Tree Extension Algebras: Logics, Automata, and Query Languages
We study relations on trees defined by first-order constraints over a vocabulary that includes the tree extension relation Ì Ì ¼, holding if and only if every branch of Ì ex...
Michael Benedikt, Leonid Libkin
GI
2004
Springer
14 years 4 months ago
A LEGO-like Lightweight Software Component Architecture for Organic Computing
Abstract: The goals of organic computing are difficult to achieve due to the heterogenity of current software components. We believe that in the long term more advanced software a...
Thomas Schöbel-Theuer
CADE
2004
Springer
14 years 4 months ago
Improved Modular Termination Proofs Using Dependency Pairs
The dependency pair approach is one of the most powerful techniques for automated (innermost) termination proofs of term rewrite systems (TRSs). For any TRS, it generates inequalit...
René Thiemann, Jürgen Giesl, Peter Sch...
CADE
2004
Springer
14 years 4 months ago
Modular Proof Systems for Partial Functions with Weak Equality
The paper presents a modular superposition calculus for the combination of first-order theories involving both total and partial functions. Modularity means that inferences are pu...
Harald Ganzinger, Viorica Sofronie-Stokkermans, Uw...
LPAR
2005
Springer
14 years 5 months ago
Automating Coherent Logic
We propose to build an automated reasoning system for first-order logic (FOL) by translating reasoning problems to a fragment of FOL called coherent logic (CL) and then solving t...
Marc Bezem, Thierry Coquand