Une procédure de décision pour un problème de satisfiabilité dans un univers ensembliste héréditairement fini
From MaRDI portal
Publication:4361575
DOI10.1051/ita/1997310302051zbMath0889.68062OpenAlexW1658779621MaRDI QIDQ4361575
Henri Lombardi, Bruno Legeard, M. Hibti
Publication date: 11 June 1998
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/92559
Logic programming (68N17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Model theory of denumerable and separable structures (03C15)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on the parallel complexity of anti-unification
- Decision procedures for elementary sublanguages of set theory: XIII. Model graphs, reflection and decidability
- Consistency in networks of relations
- Automatic theorem proving in set theory
- Towards the automation of set theory and its logic
- The automation of syllogistic. II: Optimization and complexity issues
- Decidability of systems of set constraints with negative constraints
- {log}: A language for programming in logic with finite sets
- Decision procedures for elementary sublanguages of set theory. I. Multi-level syllogistic and some extensions
- Undecidability results for restricted universally quantified formulae of set theory
- Une procédure de décision pour un problème de satisfiabilité dans un univers ensembliste héréditairement fini
This page was built for publication: Une procédure de décision pour un problème de satisfiabilité dans un univers ensembliste héréditairement fini
