L.T. McCarty, personal communication, November, 1992. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
On Goal-Directed Provability in Classical Logic - Harland (1994) (3 citations) (Correct)
....difficult to describe this proof as goal directed. Hence it would seem that stronger restrictions than goal directed provability need to be placed on the class of proofs in order to determine logic programming languages. It seems probable that McCarty s notion of perspicuous non determinism [7] would be useful here, so that some kind of paradigm of formulae as instructions is followed, with a some specific nature of the instruction corresponding to each connective being given by the programmer prior to considerations of the completeness of goal directed proofs and the like. 6 ....
L.T. McCarty, personal communication, November, 1992.
Tractable Reasoning in Knowledge Representation Systems - Dalal (1995) (2 citations) (Correct)
....does not have bounded intricacy. Note that the exact details of the satisfiable theories in the class C 3 is not important the only requirement is that the condition of Theorem 5.2 is violated, i.e. there is no number k which bounds the intricacy of all satisfiable theories in C 3 . McCarty [McC95] observed that theories in class C 3 can not be enumerated easily, since it contains all satisfiable theories and no unsatisfiable theory other than pigeon hole theories. He suggested two other classes that are better examples for showing that the criteria of Theorems 5.1 and 5.2 are not ....
T. McCarty. Personal Communication, 1995.
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