z-logo
open-access-imgOpen Access
Completeness for linear regular negation normal form inference systems
Author(s) -
Reiner Hähnle,
Neil V. Murray,
Erik Rosenthal
Publication year - 1997
Publication title -
lecture notes in computer science
Language(s) - Uncategorized
Resource type - Book series
SCImago Journal Rank - 0.249
H-Index - 400
eISSN - 1611-3349
pISSN - 0302-9743
ISBN - 3-540-63614-5
DOI - 10.1007/3-540-63614-5_57
Subject(s) - completeness (order theory) , negation , literal (mathematical logic) , mathematical proof , conjunctive normal form , inference , resolution (logic) , computer science , mathematics , discrete mathematics , calculus (dental) , programming language , artificial intelligence , medicine , mathematical analysis , geometry , dentistry
NONE

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom