Sciweavers

827 search results - page 146 / 166
» Proof-Theoretic Soundness and Completeness
Sort
View
APWEB
2011
Springer
14 years 4 months ago
A Tableau Algorithm for Paraconsistent and Nonmonotonic Reasoning in Description Logic-Based System
This paper proposes a paraconsistent and nonmonotonic extension of description logic by planting a nonmonotonic mechanism called minimal inconsistency in paradoxical description lo...
Xiaowang Zhang, Zuoquan Lin, Kewen Wang
IANDC
2011
119views more  IANDC 2011»
14 years 4 months ago
Quantitative Kleene coalgebras
We present a systematic way to generate (1) languages of (generalised) regular expressions, and (2) sound and complete axiomatizations thereof, for a wide variety of quantitative ...
Alexandra Silva, Filippo Bonchi, Marcello M. Bonsa...
JAIR
2011
166views more  JAIR 2011»
14 years 4 months ago
Decidability and Undecidability Results for Propositional Schemata
We define a logic of propositional formula schemata adding to the syntax of propositional logic indexed propositions (e.g., pi) and iterated connectives ∨ or ∧ ranging over i...
Vincent Aravantinos, Ricardo Caferra, Nicolas Pelt...
JAR
2010
98views more  JAR 2010»
14 years 4 months ago
Proof-Guided Test Selection from First-Order Specifications with Equality
This paper deals with test case selection from axiomatic specifications whose axioms are quantifier-free first-order formulas with equality. We first prove the existence of an ide...
Delphine Longuet, Marc Aiguier, Pascale Le Gall
CORR
2011
Springer
210views Education» more  CORR 2011»
14 years 1 months ago
Binary Sequent Calculi for Truth-invariance Entailment of Finite Many-valued Logics
In this paper we consider the class of truth-functional many-valued logics with a finite set of truth-values. The main result of this paper is the development of a new binary sequ...
Zoran Majkic