Embedding boolean expressions into logic programming

Authors:
Wolfram Buttner;Helmut Simonis
Affiliations:
Siemens AG Corporate Laboratories for Information Technology Otto-Hahn.Ring 6 8000 Münehen 83, Germany;EURC Arabelastr. 17 8000 München 81, Germany
Venue:
Journal of Symbolic Computation
Year:
1987

Citing 7
Cited 15

Refutational theorem proving using term-rewriting systems

Artificial Intelligence
Unification in datastructure multisets

Journal of Automated Reasoning
Unification in the data structure sets

Proc. of the 8th international conference on Automated deduction
Unification in Boolean rings

Proc. of the 8th international conference on Automated deduction
A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
A Unification Algorithm for Associative-Commutative Functions

Journal of the ACM (JACM)
Universal Unification

Proceedings of the 7th International Conference on Automated Deduction

Constraint logic programming languages

Communications of the ACM
An introduction to Prolog III

Communications of the ACM
Unification in primal algebras, their powers and their varieties

Journal of the ACM (JACM)
Toward the partial evaluation of CLP languages

PEPM '91 Proceedings of the 1991 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Symbolic Boolean manipulation with ordered binary-decision diagrams

ACM Computing Surveys (CSUR)
Proving circuit correctness using formal comparison between expected and extracted behaviour

DAC '88 Proceedings of the 25th ACM/IEEE Design Automation Conference
Constraint query languages (preliminary report)

PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Toupie: The µ-calculus over Finite Domains as a Constraint Language

Journal of Automated Reasoning
Defeasible Constraint Solving over the Booleans

IBERAMIA '98 Proceedings of the 6th Ibero-American Conference on AI: Progress in Artificial Intelligence
Generating Propagation Rules for Finite Domains: A Mixed Approach

Selected papers from the Joint ERCIM/Compulog Net Workshop on New Trends in Contraints
Constraint synthesis for environment modeling in functional verification

Proceedings of the 40th annual Design Automation Conference
Set unification

Theory and Practice of Logic Programming
A computational structure for the propositional calculus

IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 1
A Boolean algebra algorithm suitable for use in temperature-humidity control of a grafted seedling acclimatization chamber

Computers and Electronics in Agriculture
Solving a cutting-stock problem with the constraint logic programming language chip

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	0.03

Visualization

Abstract

Boolean expressions play a major role in computer science. They can be used to represent sets, formulas of propositional logic and digital circuits. In this paper we present an algorithm to compute the most general unifier (mgu) of boolean expressions, which is unique, if it exists. The fact that there is always at most one mgu, i.e. the theory of boolean expressions is unitary, is of particular importance for the embedding of the data type 'boolean expression' into logic programming. First experiemes with an integration into a PROLOG system are shown.