Sciweavers

DLOG
2009
13 years 9 months ago
Model-Based Most Specific Concepts in Some Inexpressive Description Logics
Abstract. Model-based most specific concepts are a non-standard reasoning service in Description Logics. They have turned out to be useful in knowledge base completion for ontologi...
Felix Distel
DLOG
2009
13 years 9 months ago
Reasoning With Weighted Ontologies
We study the problem of reasoning over weighted ontologies. We assume that every axiom is labeled with an element of a distributive lattice (called its weight) and try to compute i...
Rafael Peñaloza
RWEB
2010
Springer
13 years 9 months ago
Model Driven Engineering with Ontology Technologies
Ontologies constitute formal models of some aspect of the world that may be used for drawing interesting logical conclusions even for large models. Software models capture relevant...
Steffen Staab, Tobias Walter, Gerd Gröner, Fe...
RR
2010
Springer
13 years 9 months ago
Analyzing the AIR Language: A Semantic Web (Production) Rule Language
The Accountability In RDF (AIR) language is an N3-based, Semantic Web production rule language that supports nested activation of rules, negation, closed world reasoning, scoped co...
Ankesh Khandelwal, Jie Bao, Lalana Kagal, Ian Jaco...
LPAR
2010
Springer
13 years 9 months ago
Counting and Enumeration Problems with Bounded Treewidth
By Courcelle's Theorem we know that any property of finite structures definable in monadic second-order logic (MSO) becomes tractable over structures with bounded treewidth. T...
Reinhard Pichler, Stefan Rümmele, Stefan Wolt...
LPAR
2010
Springer
13 years 9 months ago
Semiring-Induced Propositional Logic: Definition and Basic Algorithms
In this paper we introduce an extension of propositional logic that allows clauses to be weighted with values from a generic semiring. The main interest of this extension is that ...
Javier Larrosa, Albert Oliveras, Enric Rodrí...
LPAR
2010
Springer
13 years 9 months ago
Hardness of Preorder Checking for Basic Formalisms
We investigate the complexity of preorder checking when the specification is a flat finite-state system whereas the implementation is either a non-flat finite-state system or a st...
Laura Bozzelli, Axel Legay, Sophie Pinchinat
LPAR
2010
Springer
13 years 9 months ago
Speed-Up Techniques for Negation in Grounding
Abstract. Grounding is the task of reducing a first order formula to ground formula that is equivalent on a given universe, and is important in many kinds of problem solving and re...
Amir Aavani, Shahab Tasharrofi, Gulay Ünel, E...
LPAR
2010
Springer
13 years 9 months ago
Synthesis of Trigger Properties
In automated synthesis, we transform a specification into a system that is guaranteed to satisfy the specification. In spite of the rich theory developed for temporal synthesis, l...
Orna Kupferman, Moshe Y. Vardi
LPAR
2010
Springer
13 years 9 months ago
Disunification for Ultimately Periodic Interpretations
Abstract. Disunification is an extension of unification to first-order formulae over syntactic equality atoms. Instead of considering only syntactic equality, I extend a disunifica...
Matthias Horbach