Last update: Thu Jun 20 02:00:37 MDT 2019
@Article{Harland:1997:GPC,
author = "James Harland",
title = "On goal-directed provability in classical logic",
journal = j-COMP-LANGS,
volume = "23",
number = "2-4",
pages = "161--178",
month = jul # "--" # dec,
year = "1997",
CODEN = "COLADA",
ISSN = "0096-0551 (print), 1873-6742 (electronic)",
ISSN-L = "0096-0551",
bibdate = "Sun Oct 25 08:22:03 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/complngs.bib",
acknowledgement = ack-nhfb,
affiliation = "Royal Melbourne Inst of Technology",
affiliationaddress = "Melbourne, Aust",
classification = "721.1; 723.1; 723.1.1; C4210 (Formal logic); C4240
(Programming and algorithm theory); C6110L (Logic
programming); C6140D (High level languages)",
conference = "Proceedings of the 1994 11th International Conference
on Logic Programming, ICLP'94",
corpsource = "Dept. of Comput. Sci., R. Melbourne Inst. of Technol.,
Vic., Australia",
journal-URL = "http://www.sciencedirect.com/science/journal/00960551",
journalabr = "Comput Lang",
keywords = "answer substitutions; Classical logic; classical
logic; completeness; computation; disjunctive logic
programs; Formal languages; Formal logic; formal logic;
Goal directed proofs; goal-directed provability;
intuitionistic logic; Logic programming; logic
programming; logic programming languages; logical
connectives; permutability properties; programming
theory; proof search; proof-theoretic characterization;
Theorem proving; uniform proof",
meetingaddress = "Santa Margherite Ligure, Italy",
meetingdate = "Jun 1994",
meetingdate2 = "06/94",
pubcountry = "UK",
treatment = "T Theoretical or Mathematical",
}