Results 1  10
of
5,047
Finiteness in infinitevalued Lukasiewicz logic
, 2000
"... In this paper we deepen Mundici's analysis on reducibility of the decision problem from infinitevalued Lukasiewicz logic L1 to a suitable mvalued Lukasiewicz logic Lm , where m only depends on the length of formulas to be proved. Using geometrical arguments we find a better upper bound for th ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
In this paper we deepen Mundici's analysis on reducibility of the decision problem from infinitevalued Lukasiewicz logic L1 to a suitable mvalued Lukasiewicz logic Lm , where m only depends on the length of formulas to be proved. Using geometrical arguments we find a better upper bound
The logical content of triangular bases of fuzzy sets in Lukasiewicz infinitevalued logic
"... Continuing to pursue a research direction that we already explored in connection with GödelDummett logic and Ruspini partitions, we show here that Lukasiewicz logic is able to express the notion of pseudotriangular basis of fuzzy sets, a mild weakening of the standard notion of triangular basis. ..."
Abstract
 Add to MetaCart
Continuing to pursue a research direction that we already explored in connection with GödelDummett logic and Ruspini partitions, we show here that Lukasiewicz logic is able to express the notion of pseudotriangular basis of fuzzy sets, a mild weakening of the standard notion of triangular basis
Recursively Enumerable Prime Theories in InfiniteValued Lukasiewicz Logic are not Uniformly Decidable
"... In infinitevalued Lukasiewicz logic it is wellknown that prime theories do not coincide with maximally consistent (complete) theories. It is said that a theory T is prime if, for every pair of formulas ϕ,ψ either ϕ → ψ ∈ T or ψ → ϕ ∈ T. On the other hand, T is maximally consistent if, whenever ϕ 6 ..."
Abstract
 Add to MetaCart
In infinitevalued Lukasiewicz logic it is wellknown that prime theories do not coincide with maximally consistent (complete) theories. It is said that a theory T is prime if, for every pair of formulas ϕ,ψ either ϕ → ψ ∈ T or ψ → ϕ ∈ T. On the other hand, T is maximally consistent if, whenever ϕ
Bounded Lukasiewicz Logics
"... Lukasiewicz logics were introduced for philosophical reasons by Jan Lukasiewiczin the 1920s [8] and are among the first examples of manyvalued logics. Currently they are of great importance in several areas of research. Firstly, in fuzzylogic [15], where infinitevalued Lukasiewicz logic ..."
Abstract
 Add to MetaCart
Lukasiewicz logics were introduced for philosophical reasons by Jan Lukasiewiczin the 1920s [8] and are among the first examples of manyvalued logics. Currently they are of great importance in several areas of research. Firstly, in fuzzylogic [15], where infinitevalued Lukasiewicz logic
Prosodic Morphology: constraint interaction and satisfaction
, 1993
"... Permission is hereby granted by the authors to reproduce this document, in whole or in part, for personal use, for instruction, or for any other noncommercial purpose. Table of Contents Acknowledgments......................................................... ..."
Abstract

Cited by 420 (31 self)
 Add to MetaCart
Permission is hereby granted by the authors to reproduce this document, in whole or in part, for personal use, for instruction, or for any other noncommercial purpose. Table of Contents Acknowledgments.........................................................
Logic in Computer Science: Modelling and Reasoning about Systems
, 1999
"... ion. ACM Transactions on Programming Languages and Systems, 16(5):15121542, September 1994. Bibliography 401 [Che80] B. F. Chellas. Modal Logic  an Introduction. Cambridge University Press, 1980. [Dam96] D. R. Dams. Abstract Interpretation and Partition Refinement for Model Checking. PhD thesi ..."
Abstract

Cited by 345 (11 self)
 Add to MetaCart
ion. ACM Transactions on Programming Languages and Systems, 16(5):15121542, September 1994. Bibliography 401 [Che80] B. F. Chellas. Modal Logic  an Introduction. Cambridge University Press, 1980. [Dam96] D. R. Dams. Abstract Interpretation and Partition Refinement for Model Checking. Ph
Constraint Query Languages
, 1992
"... We investigate the relationship between programming with constraints and database query languages. We show that efficient, declarative database programming can be combined with efficient constraint solving. The key intuition is that the generalization of a ground fact, or tuple, is a conjunction ..."
Abstract

Cited by 380 (44 self)
 Add to MetaCart
of constraints over a small number of variables. We describe the basic Constraint Query Language design principles and illustrate them with four classes of constraints: real polynomial inequalities, dense linear order inequalities, equalities over an infinite domain, and boolean equalities. For the analysis
Query Answering in Inconsistent Databases
, 2003
"... In this chapter, we summarize the research on querying inconsistent databases we have been conducting over the last five years. The formal framework we have used is based on two concepts: repair and consistent query answer. We describe different approaches to the issue of computing consistent query ..."
Abstract

Cited by 365 (69 self)
 Add to MetaCart
answers: query transformation, logic programming, inference in annotated logics, and specialized algorithms. We also characterize the computational complexity of this problem. Finally, we discuss related research in artificial intelligence, databases, and logic programming.
Results 1  10
of
5,047