Embedding Boolean expressions into logic programming
From MaRDI portal
Publication:1100935
DOI10.1016/S0747-7171(87)80065-2zbMATH Open0641.68148MaRDI QIDQ1100935FDOQ1100935
Wolfram Buettner, Helmut Simonis
Publication date: 1987
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Machine-Oriented Logic Based on the Resolution Principle
- Title not available (Why is that?)
- A Unification Algorithm for Associative-Commutative Functions
- Title not available (Why is that?)
- Refutational theorem proving using term-rewriting systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Unification in abelian semigroups
- DIOPHANTINE REPRESENTATION OF ENUMERABLE PREDICATES
Cited In (22)
- Propositional calculus problems in CHIP
- Complexity assessments for decidable fragments of set theory. II: A taxonomy for `small' languages involving membership
- On equational theories, unification, and (un)decidability
- IMPLEMENTING COMPLEX DOMAINS OF APPLICATION IN AN EXTENDED PROLOG SYSTEM
- Running time experiments on some algorithms for solving propositional satisfiability problems
- On the complexity of Boolean unification
- Complexity Assessments for Decidable Fragments of Set Theory. I: A Taxonomy for the Boolean Case*
- Discriminator varieties and symbolic computation
- Negative Boolean constraints
- Unification in varieties of idempotent semigroups
- Unification in commutative idempotent monoids
- Unification in Boolean rings
- Controlling the complexity in model-based diagnosis
- Symbolic constraint handling through unification in finite algebras
- Boolean unification - the story so far
- The Evaluation and the Computational Complexity of Datalog Queries of Boolean Constraint Databases
- Solving a cutting-stock problem with the constraint logic programming language CHIP
- Ordered Binary Decision Diagrams and the Davis-Putnam procedure
- Complexity assessments for decidable fragments of Set Theory. III: Testers for crucial, polynomial-maximal decidable Boolean languages
- Constraint satisfaction using constraint logic programming
- Goals and benchmarks for automated map reasoning
- Unification problem in equational theories
This page was built for publication: Embedding Boolean expressions into logic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1100935)
