Results 1  10
of
949
Decision Procedures for flat settheoretical syllogistics. I. General union, powerset and singleton operators
, 1992
"... fragment of the elementary theory of rela tions and some applications. In hteratioal $yraposium o Symbolic ad Algebraic Coraputatiot, pages 24 29. ACM Sigsam, 1990. [CC90b] D. Cantone and V. Cutello. Decision procedures for elementary sublanguages of set theory. XV. Multilevel syllogistic extende ..."
Abstract
 Add to MetaCart
extended by the predicate fizzire and the operators singleton and pred<. Jourtal of Automated Reasotitg, XV, 6::189 201, 1990. [CCF89] D. Cantone, V. Cutello, and A. Ferro. Decision procedures for elementary sublanguages of set theory. XIV. Three languages involving rank related constructs
Formative processes with applications to the decision problem in set theory: I. Powerset and singleton operators.
"... This paper introduces formative processes, composed by transitive partitions. Given a family F of sets, a formative process ending in the Venn partition of F is shown to exist. Sufficient criteria are also singled out for a transitive partition to model (via a function from set variables to unions o ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
in computable set theory is rediscovered, namely the one that regards the satis ability of unquanti ed settheoretic formulae involving Boolean operators, the singletonformer, and the powerset operator. The method described can be extended to decide the satisfiability problem for broader fragments of set
A Decision Procedure for a Sublanguage of Set Theory Involving Monotone, Additive, and Multiplicative Functions
 Publications in Conferences and Workshops
, 2003
"... MLSS is a decidable sublanguage of set theory involving the predicates membership, set equality, set inclusion, and the operators union, intersection, set di#erence, and singleton. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
MLSS is a decidable sublanguage of set theory involving the predicates membership, set equality, set inclusion, and the operators union, intersection, set di#erence, and singleton.
FORMATIVE PROCESSES WITH APPLICATIONS TO THE DECISION PROBLEM IN SET THEORY: I. POWERSET AND
"... research, of fruitful exchanges of ideas during periodic meetings at IASI/CNR. ..."
Abstract
 Add to MetaCart
research, of fruitful exchanges of ideas during periodic meetings at IASI/CNR.
Categorial Type Logics
 Handbook of Logic and Language
, 1997
"... Contents 1 Introduction: grammatical reasoning 1 2 Linguistic inference: the Lambek systems 5 2.1 Modelinggrammaticalcomposition ............................ 5 2.2 Gentzen calculus, cut elimination and decidability . . . . . . . . . . . . . . . . . . . . 9 2.3 Discussion: options for resource mana ..."
Abstract

Cited by 299 (6 self)
 Add to MetaCart
Contents 1 Introduction: grammatical reasoning 1 2 Linguistic inference: the Lambek systems 5 2.1 Modelinggrammaticalcomposition ............................ 5 2.2 Gentzen calculus, cut elimination and decidability . . . . . . . . . . . . . . . . . . . . 9 2.3 Discussion: options for resource management . . . . . . . . . . . . . . . . . . . . . . 13 3 The syntaxsemantics interface: proofs and readings 16 3.1 Term assignment for categorial deductions . . . . . . . . . . . . . . . . . . . . . . . . 17 3.2 Natural language interpretation: the deductive view . . . . . . . . . . . . . . . . . . . 21 4 Grammatical composition: multimodal systems 26 4.1 Mixedinference:themodesofcomposition........................ 26 4.2 Grammaticalcomposition:unaryoperations ....................... 30 4.2.1 Unary connectives: logic and structure . . . . . . . . . . . . . . . . . . . . . . . 31 4.2.2 Applications: imposing constraints, structural relaxation
Transitive Venn diagrams with applications to the decision problem in set theory
 in set theory, Proc. APPIA GULP PRODE '99 Joint Conference on Declarative Programming
, 2000
"... This paper introduces the notions of transitive partition and of transitive Venn diagram of a collection of sets, and gives sufficient conditions in order that two transitive Venn diagrams satisfy a same family of settheoretic literals. As a byproduct, one of the core results on decidability in co ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
in computable set theory is rediscovered, namely the one that regards the satis ability of unquantified settheoretic formulae involving Boolean operators, the singletonformer, and the powerset operator. The method described is amenable to extensions able to deal with more general satisfiability decision
Towards TableauBased Decision Procedures for NonWellFounded Fragments of Set Theory
 In Proceedings of TABLEAUXâ€™00
, 2000
"... We propose a tableaulike decision procedure for deciding the finite satisfiability of unquantified formulae with (a weak form of) powerset constructor. Our results apply to a rather large class of nonwellfounded set theories. The decidability result presented can be seen as a first step towards th ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
We propose a tableaulike decision procedure for deciding the finite satisfiability of unquantified formulae with (a weak form of) powerset constructor. Our results apply to a rather large class of nonwellfounded set theories. The decidability result presented can be seen as a first step towards
Identifying the minimal transversals of a hypergraph and related problems
 SIAM Journal on Computing
, 1995
"... The paper considers two decision problems on hypergraphs, hypergraph saturation and recognition of the transversal hypergraph, and discusses their significance for several search problems in applied computer science. Hypergraph saturation, i.e., given a hypergraph H, decide if every subset of vertic ..."
Abstract

Cited by 152 (8 self)
 Add to MetaCart
The paper considers two decision problems on hypergraphs, hypergraph saturation and recognition of the transversal hypergraph, and discusses their significance for several search problems in applied computer science. Hypergraph saturation, i.e., given a hypergraph H, decide if every subset
INSTANTIATION AND DECISION PROCEDURES FOR CERTAIN CLASSES OF QUANTIFIED SETTHEORETIC FORMULAE
, 1978
"... Settheoretically oriented mechanical theorem provers can exploit the fact that all notions in set theory can be derined in terms of the two primitives equality and set membership. However, since set theory permits very general constructions, such provers find it hard to decide, even in apparentlytr ..."
Abstract
 Add to MetaCart
Settheoretically oriented mechanical theorem provers can exploit the fact that all notions in set theory can be derined in terms of the two primitives equality and set membership. However, since set theory permits very general constructions, such provers find it hard to decide, even
Results 1  10
of
949