All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 3 Next

Displaying 41 – 60 of 1303

Showing per page

A logic-based environment for developing natural language processing applications

Gérard Milhaud, Élisabeth Godbert (1998)

Mathématiques et Sciences Humaines

We present a system providing a set of tools for developing natural language processing (NLP) applications such as natural language interfaces, communication aid systems, etc. This system is based on two principles: modularity of knowledge representation to ensure the portability of the system, and guided sentence composition to ensure transparency, i.e. to ensure that the produced sentences are well-formed at the lexical, syntactic, semantic and conceptual levels. We first describe the formalisms...

A non commutative generalization of ☆ -autonomous lattices

P. Emanovský, Jiří Rachůnek (2008)

Czechoslovak Mathematical Journal

Pseudo ☆ -autonomous lattices are non-commutative generalizations of ☆ -autonomous lattices. It is proved that the class of pseudo ☆ -autonomous lattices is a variety of algebras which is term equivalent to the class of dualizing residuated lattices. It is shown that the kernels of congruences of pseudo ☆ -autonomous lattices can be described as their normal ideals.

A non-uniform finitary relational semantics of system T

Lionel Vaux (2013)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

We study iteration and recursion operators in the denotational semantics of typed λ-calculi derived from the multiset relational model of linear logic. Although these operators are defined as fixpoints of typed functionals, we prove them finitary in the sense of Ehrhard’s finiteness spaces.

A Note on Negative Tagging for Least Fixed-Point Formulae

Dilian Gurov, Bruce Kapron (2010)

RAIRO - Theoretical Informatics and Applications

Proof systems with sequents of the form U ⊢ Φ for proving validity of a propositional modal μ-calculus formula Φ over a set U of states in a given model usually handle fixed-point formulae through unfolding, thus allowing such formulae to reappear in a proof. Tagging is a technique originated by Winskel for annotating fixed-point formulae with information about the proof states at which these are unfolded. This information is used later in the proof to avoid unnecessary unfolding, without...

A note on paracomplete logic

Newton C. A. da Costa, Diego Marconi (1986)

Atti della Accademia Nazionale dei Lincei. Classe di Scienze Fisiche, Matematiche e Naturali. Rendiconti Lincei. Matematica e Applicazioni

In questa nota gli Autori descrivono nuovi sistemi di logica (detta «paracompleta») connessi con la logica della vaghezza («fuzzy logic») e con le logiche paraconsistenti.

A note on Sugihara algebras.

Josep M. Font, Gonzalo Rodríguez Pérez (1992)

Publicacions Matemàtiques

In [4] Blok and Pigozzi prove syntactically that RM, the propositional calculus also called R-Mingle, is algebraizable, and as a consequence there is a unique quasivariety (the so-called equivalent quasivariety semantics) associated to it. In [3] it is stated that this quasivariety is the variety of Sugihara algebras. Starting from this fact, in this paper we present an equational base for this variety obtained as a subvariety of the variety of R-algebras, found in [7] to be associated in the same...

Currently displaying 41 – 60 of 1303