Logic Journal of the IGPL 14 (2):305-319 (2006)

Authors
Abstract
This papers presents δ-resolution, a dual resolution calculus. It is based on standard resolution, and used appropriate formulae equivalent to disjunctive normal forms, instead of conjunctive normal ones, as it is the case for resolution. This duality is then useful to create a calculus for abductive process, as a way to construct a set of abductive solutions. The proposed calculus is compared to semantic tableaux, an standard logical framework, aslo illuminating when studying abduction.δ-resolution calculus is a contribution to logic programming, and it further suggests new possibilities to explore abduction at a first order level, in the lines of those proposed in [9]
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1093/jigpal/jzk020
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 51,304
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

Add more references

Citations of this work BETA

A Verisimilitudinarian Analysis of the Linda Paradox.Gustavo Cevolani, Vincenzo Crupi & Roberto Festa - 2012 - VII Conference of the Spanish Society for Logic, Methodology and Philosphy of Science.

Add more citations

Similar books and articles

A Resolution Calculus For Shortening Proofs.Nicolas Peltier - 2005 - Logic Journal of the IGPL 13 (3):307-333.
The Complexity of Resolution Refinements.Joshua Buresh-Oppenheim & Toniann Pitassi - 2007 - Journal of Symbolic Logic 72 (4):1336 - 1352.
Mints Type Deductive Calculi for Logic Programming.J. C. Shepherdson - 1992 - Annals of Pure and Applied Logic 56 (1-3):7-17.
Resolution Calculus for the First Order Linear Logic.Grigori Mints - 1993 - Journal of Logic, Language and Information 2 (1):59-83.
Pool Resolution is NP-Hard to Recognize.Samuel R. Buss - 2009 - Archive for Mathematical Logic 48 (8):793-798.
Resolution-Based Methods for Modal Logics.H. de Nivelle, R. Schmidt & U. Hustadt - 2000 - Logic Journal of the IGPL 8 (3):265-292.

Analytics

Added to PP index
2015-02-04

Total views
9 ( #852,039 of 2,330,100 )

Recent downloads (6 months)
2 ( #393,046 of 2,330,100 )

How can I increase my downloads?

Downloads

My notes