Results 1  10
of
571,917
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
for the least integer m such that a formula is valid in L1 if and only if so is in Lm . We also reduce the notion of logical consequence in L1 to the same notion in a suitable finite set of finitevalued Lukasiewicz logics. Finally, we de ne an analytic and internal sequent calculus for infinitevalued
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
Automatic verification of finitestate concurrent systems using temporal logic specifications
 ACM Transactions on Programming Languages and Systems
, 1986
"... We give an efficient procedure for verifying that a finitestate concurrent system meets a specification expressed in a (propositional, branchingtime) temporal logic. Our algorithm has complexity linear in both the size of the specification and the size of the global state graph for the concurrent ..."
Abstract

Cited by 1384 (62 self)
 Add to MetaCart
We give an efficient procedure for verifying that a finitestate concurrent system meets a specification expressed in a (propositional, branchingtime) temporal logic. Our algorithm has complexity linear in both the size of the specification and the size of the global state graph for the concurrent
Alternatingtime Temporal Logic
 Journal of the ACM
, 1997
"... Temporal logic comes in two varieties: lineartime temporal logic assumes implicit universal quantification over all paths that are generated by system moves; branchingtime temporal logic allows explicit existential and universal quantification over all paths. We introduce a third, more general var ..."
Abstract

Cited by 615 (55 self)
 Add to MetaCart
Temporal logic comes in two varieties: lineartime temporal logic assumes implicit universal quantification over all paths that are generated by system moves; branchingtime temporal logic allows explicit existential and universal quantification over all paths. We introduce a third, more general
A New Method for Solving Hard Satisfiability Problems
 AAAI
, 1992
"... We introduce a greedy local search procedure called GSAT for solving propositional satisfiability problems. Our experiments show that this procedure can be used to solve hard, randomly generated problems that are an order of magnitude larger than those that can be handled by more traditional approac ..."
Abstract

Cited by 734 (21 self)
 Add to MetaCart
We introduce a greedy local search procedure called GSAT for solving propositional satisfiability problems. Our experiments show that this procedure can be used to solve hard, randomly generated problems that are an order of magnitude larger than those that can be handled by more traditional
Abduction in Logic Programming
"... Abduction in Logic Programming started in the late 80s, early 90s, in an attempt to extend logic programming into a framework suitable for a variety of problems in Artificial Intelligence and other areas of Computer Science. This paper aims to chart out the main developments of the field over th ..."
Abstract

Cited by 616 (76 self)
 Add to MetaCart
Abduction in Logic Programming started in the late 80s, early 90s, in an attempt to extend logic programming into a framework suitable for a variety of problems in Artificial Intelligence and other areas of Computer Science. This paper aims to chart out the main developments of the field over
A Framework for Defining Logics
 JOURNAL OF THE ASSOCIATION FOR COMPUTING MACHINERY
, 1993
"... The Edinburgh Logical Framework (LF) provides a means to define (or present) logics. It is based on a general treatment of syntax, rules, and proofs by means of a typed calculus with dependent types. Syntax is treated in a style similar to, but more general than, MartinLof's system of ariti ..."
Abstract

Cited by 807 (45 self)
 Add to MetaCart
The Edinburgh Logical Framework (LF) provides a means to define (or present) logics. It is based on a general treatment of syntax, rules, and proofs by means of a typed calculus with dependent types. Syntax is treated in a style similar to, but more general than, MartinLof's system
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
6 ∈ T, some finite Lukasiewicz sum ¬ϕ ⊕... ⊕ ¬ϕ is in T. It is very easy to see that recursively enumerable maximally consistent theories in the infinitevalued Lukasiewicz logic are decidable: simply recursively enumerate the theory until ϕ or ¬ϕ⊕...⊕¬ϕ appears. In [MP01] Mundici and Panti proved
Results 1  10
of
571,917