Embedding Boolean expressions into logic programming
From MaRDI portal
Publication:1100935
Recommendations
Cites work
- scientific article; zbMATH DE number 3872640 (Why is no real title available?)
- scientific article; zbMATH DE number 4155934 (Why is no real title available?)
- scientific article; zbMATH DE number 4049133 (Why is no real title available?)
- scientific article; zbMATH DE number 3731310 (Why is no real title available?)
- scientific article; zbMATH DE number 3501560 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3299786 (Why is no real title available?)
- scientific article; zbMATH DE number 3413831 (Why is no real title available?)
- A Machine-Oriented Logic Based on the Resolution Principle
- A Unification Algorithm for Associative-Commutative Functions
- DIOPHANTINE REPRESENTATION OF ENUMERABLE PREDICATES
- Refutational theorem proving using term-rewriting systems
- Unification in abelian semigroups
Cited in
(22)- On equational theories, unification, and (un)decidability
- Goals and benchmarks for automated map reasoning
- Controlling the complexity in model-based diagnosis
- Boolean unification - the story so far
- Propositional calculus problems in CHIP
- IMPLEMENTING COMPLEX DOMAINS OF APPLICATION IN AN EXTENDED PROLOG SYSTEM
- Symbolic constraint handling through unification in finite algebras
- Discriminator varieties and symbolic computation
- Ordered binary decision diagrams and the Davis-Putnam procedure
- Unification problem in equational theories
- Unification in Boolean rings
- Running time experiments on some algorithms for solving propositional satisfiability problems
- Unification in varieties of idempotent semigroups
- Complexity assessments for decidable fragments of Set Theory. III: Testers for crucial, polynomial-maximal decidable Boolean languages
- Constraint satisfaction using constraint logic programming
- Complexity assessments for decidable fragments of set theory. I: A taxonomy for the Boolean case
- Solving a cutting-stock problem with the constraint logic programming language CHIP
- Negative Boolean constraints
- Unification in commutative idempotent monoids
- Complexity assessments for decidable fragments of set theory. II: A taxonomy for `small' languages involving membership
- On the complexity of Boolean unification
- The Evaluation and the Computational Complexity of Datalog Queries of Boolean Constraint Databases
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)
