Ekaterina Komendantskaya + Vladimir Komendantsky November 15, 2005  Home/Search
Context
Related
| bcri.ucc.ie/BCRI_54.pdf Cached: PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
PS.gz PS Image Update HelpFrom: bcri.ucc.ie/nonPeerReviewed (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We study a general proof-theoretical framework for logic programming, the so called uniform proofs. We consider several logic programming systems derived in a natural way from logical proof systems (namely, from classical, intuitionistic, minimal, positive, relevance, or paranormal sequent calculi). Our result is the construction of proof-theoretical logic programming systems for philosophically significant logics. 1 (Update)
Active bibliography (related documents): More All
0.3: Relevant and Substructural Logics - Restall (2001) (Correct)
0.3: Conditional Deduction under Uncertainty - Jøsang, Pope, Daniel (2005) (Correct)
0.0: Disjunction and Modular Goal-directed Proof Search - Stone (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ vladimir-uniform,
author = "Ekaterina Komendantskaya Vladimir",
title = "On Uniform Proof-Theoretical Operational Semantics for Logic Programming",
url = "citeseer.ist.psu.edu/748749.html" }
Citations (may not include all citations):149 A logical analysis of modules in logic programming (context) - Miller - 1989
133 Foundations of Logic Programming (context) - Lloyd - 1988
116 Natural Deduction (context) - Prawitz - 1965
79 A uniform proof-theoretic investigation of linear logic prog.. - Harland, Pym - 1994
16 A multimodal logic to define modules in logic programming (context) - Baldoni, Giordano et al. - 1993
3 Relevance logic (context) - Dunn, Restall - 2002
1 a four-valued paranormal logic (context) - Popov - 2005
1 Intuitionistically admissible paranormal logic (context) - Popov, Shuklin - 2003
1 the logics related to Arruda's system V (context) - Popov - 1999
Documents on the same site (http://www.bcri.ucc.ie/nonPeerReviewed.html): More
General Error Locator Polynomials for Binary Cyclic Codes.. - Mora, Orsini, al. (2005) (Correct)
A Groebner Bases Technique To Compute Distance And Weight.. - Sala (2003) (Correct)
On the Gröbner basis of a family of quasi-cyclic LDPC codes - Giorgetti, Rossi, Sala (2005) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC