A. Nerode, J.B. Remmel. Complexity-theoretic Algebra III: Bases of Vector Spaces. In: Feasible Mathematics, Springer Verlag. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
A theory of nonmonotonic rule systems I - Marek, Nerode, Remmel (1990) (12 citations) Self-citation (Nerode Remmel) (Correct)
....Notice that during the computation we need to test if the rule is S applicable. This requires checking if ff 2 S, fi 1 ; fi m = 2 S. This can be carried out by the ordinary tableaux method, or any other complete theorem prover. These remarks are the source of the algorithm of [Marek and Nerode, 1990], in which a version specifically tailored to default logic is developed. 4.6 Propositional logic programming, general case A general logic program is a list of general clauses, of the form: p q 1 ; q n ; r 1 ; rm We refer to [Gelfond and Lifschitz, 1988] for the definition ....
A. Nerode, J.B. Remmel. Complexity-theoretic Algebra III: Bases of Vector Spaces. In: Feasible Mathematics, Springer Verlag.
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