Eine entscheidbare Klasse n-stelliger Horn-Pr\"adikate
Logic in Computer Science
2014-04-09 v1
Abstract
Similar to a tree grammar, a Horn theory can be used to describe an infinite set of terms. In this paper, we present a class of Horn theories such that the set of definable predicates is closed wrt. conjunction and such that the satisfiability of a predicate is decidable. This extends previous results on Horn clauses with unary predicates.
Cite
@article{arxiv.1404.1947,
title = {Eine entscheidbare Klasse n-stelliger Horn-Pr\"adikate},
author = {Jochen Burghardt},
journal= {arXiv preprint arXiv:1404.1947},
year = {2014}
}
Comments
in german; 11 pages