Now showing items 1-2 of 2
On the unique satisfiability problem
(Elsevier, 1982)
UNIQUE SAT is the problem of deciding whether a given Boolean formula has exactly one satisfying truth assignment. This problem is a typical (moreover complete) representative of a natural class of problems about unique ...
A zero-one law for logic with a fixed-point operator
(Elsevier, 1985)
The logic obtained by adding the least-fixed-point operator to first-order logic was proposed as a query language by Aho and Ullman (in "Proc. 6th ACM Sympos. on Principles of Programming Languages," 1979, pp. 110-120) and ...