NDLI: Inference with path resolution and semantic graphs

Content Provider	ACM Digital Library
Author	Murray, Neil V. Rosenthal, Erik
Copyright Year	1987
Abstract	A graphical representation of quantifier-free predicate calculus formulas in negation normal form and a new rule of inference that employs this representation are introduced. The new rule, path resolution, is an amalgamation of resolution and Prawitz analysis. The goal in the design of path resolution is to retain some of the advantages of both Prawitz analysis and resolution methods, and yet to avoid to some extent their disadvantages.Path resolution allows Prawitz analysis of an arbitrary subgraph of the graph representing a formula. If such a subgraph is not large enough to demonstrate a contradiction, a path resolvent of the subgraph may be generated with respect to the entire graph. This generalizes the notions of large inference present in hyperresolution, clash-resolution, NC-resolution, and UR-resolution. A class of subgraphs is described for which deletion of some of the links resolved upon preserves the spanning property.
Starting Page	225
Ending Page	254
Page Count	30
File Format	PDF
ISSN	00045411
e-ISSN	1557735X
DOI	10.1145/23005.23716
Journal	Journal of the ACM (JACM)
Volume Number	34
Issue Number	2
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	1987-04-01
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Content Type	Text
Resource Type	Article
Subject	Hardware and Architecture Information Systems Control and Systems Engineering Artificial Intelligence Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Automatic Theorem Proving With Renamable and Semantic Resolution

A Shortest Path Algorithm for Edge-Sparse Graphs

Resolution With Merging

Permutation Graphs and Transitive Graphs

Probabilistic inductive inference

Addressable Data Graphs

Inference of Reversible Languages

Recognizing planar perfect graphs

Inference and Paraphrase by Computer

Inference with path resolution and semantic graphs

Similar Documents

Automatic Theorem Proving With Renamable and Semantic Resolution

A Shortest Path Algorithm for Edge-Sparse Graphs

Resolution With Merging

Permutation Graphs and Transitive Graphs

Probabilistic inductive inference

Addressable Data Graphs

Inference of Reversible Languages

Recognizing planar perfect graphs

Inference and Paraphrase by Computer

Inference with path resolution and semantic graphs