Results 11  20
of
1,391
Dual Systems of Tableaux and . . .
 THE JOURNAL OF LOGIC AND ALGEBRAIC PROGRAMMING
, 2009
"... ..."
On the Minimum ManyValued Modal Logic over a Finite Residuated Lattice
, 2009
"... This article deals with manyvalued modal logics, based only on the necessity operator, over a residuated lattice. We focus on three basic classes, according to the accessibility relation, of Kripke frames: the full class of frames evaluated in the residuated lattice (and so defining the minimum mod ..."
Abstract

Cited by 15 (5 self)
 Add to MetaCart
This article deals with manyvalued modal logics, based only on the necessity operator, over a residuated lattice. We focus on three basic classes, according to the accessibility relation, of Kripke frames: the full class of frames evaluated in the residuated lattice (and so defining the minimum
A New Representation Theorem for Manyvalued Modal Logics
"... We propose a new definition of the representation theorem for manyvalued logics, with modal operators as well, and define the stronger relationship between algebraic models of a given logic and relational structures used to define the Kripke possibleworld semantics for it. Such a new framework of ..."
Abstract
 Add to MetaCart
We propose a new definition of the representation theorem for manyvalued logics, with modal operators as well, and define the stronger relationship between algebraic models of a given logic and relational structures used to define the Kripke possibleworld semantics for it. Such a new framework
MUltlog 1.0: Towards an Expert System for Manyvalued Logics
, 1996
"... MUltlog is a system which takes as input the specification of a finitelyvalued firstorder logic and produces a sequent calculus, a natural deduction system, and a calculus for transforming a manyvalued formula to clauses suitable for manyvalued resolution. All generated rules are optimized r ..."
Abstract

Cited by 9 (3 self)
 Add to MetaCart
MUltlog is a system which takes as input the specification of a finitelyvalued firstorder logic and produces a sequent calculus, a natural deduction system, and a calculus for transforming a manyvalued formula to clauses suitable for manyvalued resolution. All generated rules are optimized
Full FirstOrder Free Variable Sequents and Tableaux in Implicit Induction
 IN IMPLICIT INDUCTION. 8 TH TABLEAU 1999, LNAI 1617
, 1999
"... We show how to integrate implicit inductive theorem proving into free variable sequent and tableau calculi and compare the appropriateness of tableau calculi for this integration with that of sequent calculi. When firstorder validity is introduced to students it comes with some complete calculus ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
We show how to integrate implicit inductive theorem proving into free variable sequent and tableau calculi and compare the appropriateness of tableau calculi for this integration with that of sequent calculi. When firstorder validity is introduced to students it comes with some complete
Manyvalued logics of continuous tnorms and their functional representation
 Master’s thesis, Universià di
, 2001
"... 1.1 Manyvalued logics........................ 7 1.2 Continuous tnorms and BLalgebras.............. 11 ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
1.1 Manyvalued logics........................ 7 1.2 Continuous tnorms and BLalgebras.............. 11
Classiclike analytic tableaux for finitevalued logics
 in Proceedings of the XVI Workshop on Logic, Language, Information and Computation (WoLLIC 2009), held in Tokyo, JP, June 2009, ser. Lecture Notes in Artificial Intelligence
, 2009
"... Abstract. The paper provides a recipe for adequately representing a very inclusive class of finitevalued logics by way of tableaux. The only requisite for applying the method is that the object logic received as input should be sufficiently expressive, in having the appropriate linguistic resources ..."
Abstract

Cited by 8 (6 self)
 Add to MetaCart
and compared; the application of the rules is analytic, in that it always reduces complexity, providing thus an immediate prooftheoretical decision procedure together with a countermodel builder for the given logic. Key words: manyvalued logics, proof theory 1
GentzenType Systems, Resolution And Tableaux
 Journal of Automated Reasoning
, 1993
"... Introduction In advanced books and courses on logic (e.g. [Sm], [BM]) Gentzentype systems or their dual, tableaux, are described as techniques for showing validity of formulae which are more practical than the usual Hilberttype formalisms. People who have learnt these methods often wonder why the ..."
Abstract

Cited by 36 (13 self)
 Add to MetaCart
Introduction In advanced books and courses on logic (e.g. [Sm], [BM]) Gentzentype systems or their dual, tableaux, are described as techniques for showing validity of formulae which are more practical than the usual Hilberttype formalisms. People who have learnt these methods often wonder why
EXPTIME tableaux for ALC
 ARTIFICIAL INTELLIGENCE
, 2000
"... The last years have seen two major advances in Knowledge Representation and Reasoning. First, many interesting problems (ranging from Semistructured Data to Linguistics) were shown to be expressible in logics whose main deductive problems are EXPTIMEcomplete. Second, experiments in automated reaso ..."
Abstract

Cited by 58 (4 self)
 Add to MetaCart
The last years have seen two major advances in Knowledge Representation and Reasoning. First, many interesting problems (ranging from Semistructured Data to Linguistics) were shown to be expressible in logics whose main deductive problems are EXPTIMEcomplete. Second, experiments in automated
Results 11  20
of
1,391