Sciweavers

3032 search results - page 119 / 607
» Description Logic Rules
Sort
View
JLP
2008
81views more  JLP 2008»
13 years 10 months ago
Cut-free sequent systems for temporal logic
Currently known sequent systems for temporal logics such as linear time temporal logic and computation tree logic either rely on a cut rule, an invariant rule, or an infinitary ru...
Kai Brünnler, Martin Lange
TCS
2002
13 years 10 months ago
ELAN from a rewriting logic point of view
ELAN implements computational systems, a concept that combines two first class entities: rewrite rules and rewriting strategies. ELAN can be used either as a logical framework or ...
Peter Borovanský, Claude Kirchner, Hé...
CADE
2008
Springer
14 years 10 days ago
Automated Implicit Computational Complexity Analysis (System Description)
Recent studies have provided many characterisations of the class of polynomial time computable functions through term rewriting techniques. In this paper we describe a (fully autom...
Martin Avanzini, Georg Moser, Andreas Schnabl
AIIA
2005
Springer
14 years 3 months ago
Handling Continuous-Valued Attributes in Incremental First-Order Rules Learning
Machine Learning systems are often distinguished according to the kind of representation they use, which can be either propositional or first-order logic. The framework working wi...
Teresa Maria Altomare Basile, Floriana Esposito, N...
RR
2010
Springer
13 years 8 months ago
A Probabilistic Abduction Engine for Media Interpretation Based on Ontologies
For multimedia interpretation, and in particular for the combined interpretation of information coming from different modalities, a semantically well-founded formalization is requ...
Oliver Gries, Ralf Möller, Anahita Nafissi, M...