Sciweavers

319 search results - page 11 / 64
» Uncertainty Reasoning in Description Logics: A Generic Appro...
Sort
View
CSL
2000
Springer
13 years 11 months ago
Bounded Arithmetic and Descriptive Complexity
We study definability of languages in arithmetic and the free monoid by bounded versions of fixed-point and transitive-closure logics. In particular we give logical characterisat...
Achim Blumensath
JURIX
2008
13 years 9 months ago
Formal Aspects of Legislative Meta-Drafting
The paper presents a logic-based approach to legislative meta-drafting. A class of meta-data, corresponding to specific classes of legal provisions, is introduced and discussed. Su...
Carlo Biagioli, Davide Grossi
LICS
2005
IEEE
14 years 1 months ago
Proof-Theoretic Approach to Description-Logic
In recent work Baader has shown that a certain description logic with conjunction, existential quantification and with circular definitions has a polynomial time subsumption pro...
Martin Hofmann
JELIA
2004
Springer
14 years 25 days ago
Reasoning About Quantum Systems
Abstract. A new logic is proposed for reasoning about quantum systems. The logic embodies the postulates of quantum physics and it was designed from the semantics upwards by identi...
Paulo Mateus, Amílcar Sernadas
LPNMR
2001
Springer
13 years 12 months ago
plp: A Generic Compiler for Ordered Logic Programs
Abstract This paper describes a generic compiler, called plp, for translating ordered logic programs into standard logic programs under the answer set semantics. In an ordered logi...
James P. Delgrande, Torsten Schaub, Hans Tompits