Sciweavers

1391 search results - page 54 / 279
» Completeness of Neighbourhood Logic
Sort
View
KR
2004
Springer
14 years 2 months ago
Improving the Forward Chaining Algorithm for Conceptual Graphs Rules
Simple Conceptual Graphs (SGs) are used to represent entities and relations between these entities: they can be translated into positive, conjunctive, existential first-order log...
Jean-François Baget
FSS
2006
85views more  FSS 2006»
13 years 9 months ago
The logic of tied implications, part 2: Syntax
An implication operator A is said to be tied if there is a binary operation T that ties A; that is, the identity A(a, A(b, z)) = A(T (a, b), z) holds for all a, b, z. We aim at th...
Nehad N. Morsi, Wafik Boulos Lotfallah, Moataz Sal...
TCS
2008
13 years 9 months ago
Density elimination
Density elimination, a close relative of cut elimination, consists of removing applications of the Takeuti-Titani density rule from derivations in Gentzen-style (hypersequent) cal...
Agata Ciabattoni, George Metcalfe
ECAI
1998
Springer
14 years 1 months ago
The Complexity of Model Checking for Propositional Default Logics
Abstract. Default logic is one of the most widely used formalisms to formalize commonsense reasoning. In this paper we analyze the complexity of deciding whether a propositional in...
Paolo Liberatore, Marco Schaerf
ISMVL
1993
IEEE
140views Hardware» more  ISMVL 1993»
14 years 1 months ago
Systematic Construction of Natural Deduction Systems for Many-Valued Logics
A construction principle for natural deduction systems for arbitrary finitely-many-valued first order logics is exhibited. These systems are systematically obtained from sequent...
Matthias Baaz, Christian G. Fermüller, Richar...