Skip to Main Content
The decision problem for positive first-order logic with equality is NP-complete. More generally, if Σ is a finite set of atomic sentences (i.e., atomic formulas of the form t
Note: The Institute of Electrical and Electronics Engineers, Incorporated is distributing this Article with permission of the International Business Machines Corporation (IBM) who is the exclusive owner. The recipient of this Article may not assign, sublicense, lease, rent or otherwise transfer, reproduce, prepare derivative works, publicly display or perform, or distribute the Article.