Affiliation:
1. Institute of Discrete Mathematics and Geometry, Faculty of Mathematics and Geoinformation, TU Wien, 1040 Vienna, Austria
Abstract
Abstract
We present formula equations—first-order formulas with unknowns standing for predicates—as a general formalism for treating certain questions in logic and computer science, like the Auflösungsproblem and loop invariant generation. In the case of the language of affine terms over $\mathbb{Q}$, we translate a quantifier-free formula equation into an equivalent statement about affine spaces over $\mathbb{Q}$, which can then be decided by an iteration procedure.
Funder
Vienna Science and Technology Fund
Publisher
Oxford University Press (OUP)
Subject
Logic,Hardware and Architecture,Arts and Humanities (miscellaneous),Software,Theoretical Computer Science
Reference23 articles.
1. Untersuchungen über das Eliminationsproblem der mathematischen Logik;Ackermann;Mathematische Annalen,1935
2. On the complexity of Boolean unification;Baader,1997
3. Embedding Boolean expressions into logic programming;Büttner;Journal of Symbolic Computation,1987
4. Inductive theorem proving based on tree grammars;Eberhard;Annals of Pure and Applied Logic,2015
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A Fixed-point Theorem for Horn Formula Equations;Electronic Proceedings in Theoretical Computer Science;2021-09-13