16 search results - page 2 / 4 » lfcs 2009 |
LFCS
2009
Springer
13 years 12 months ago
2009
Springer
We introduce and illustrate a graph calculus for proving and deciding the positive identities and inclusions of fork algebras, i.e., those without occurrences of complementation. ...
LFCS
2009
Springer
13 years 12 months ago
2009
Springer
The admissible rules of a logic are those rules under which the set of theorems of the logic is closed. In a previous paper by the authors, formal systems for deriving the admissib...
LFCS
2009
Springer
13 years 12 months ago
2009
Springer
In this paper we study several properties of the Exogenous Probabilistic Propositional Logic (EPPL), a logic for reasoning about probabilities, with the purpose of introducing a t...
LFCS
2009
Springer
13 years 12 months ago
2009
Springer
We present FixIt(ALC), a novel procedure for deciding knowledge base (KB) satisfiability in the Fuzzy Description Logic (FDL) ALC. FixIt(ALC) does not search for tree-structured m...
LFCS
2009
Springer
13 years 10 months ago
2009
Springer
A bialgebra is a structure which is simultaneously an algebra and a coalgebra, such that the algebraic and coalgebraic parts are compatible. Bialgebras are usually studied over a ...