{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:17:36Z","timestamp":1725455856356},"publisher-location":"Berlin\/Heidelberg","reference-count":16,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354055887X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0023438","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T10:47:37Z","timestamp":1132397257000},"page":"357-372","source":"Crossref","is-referenced-by-count":1,"title":["Computing answers for disjunctive logic programs"],"prefix":"10.1007","author":[{"given":"Ulrich","family":"Furbach","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"21_CR1","unstructured":"R. Caferra, E. Eder, B. Fronh\u00f6fer, and W. Bibel. Extension of prolog through matrix reduction. In Proc. ECAI-84, pages 101\u2013104. North-Holland, 1984."},{"key":"21_CR2","unstructured":"M.A. Casanova, R. Guerreiro, and A. Silva. Logic programming with general clauses and defaults based on model elimination. In Proc. of the 11th IJCAI, pages 395\u2013400. Morgan Kaufmann, 1989."},{"key":"21_CR3","unstructured":"C. L. Chang and R. C. T. Lee. Symbolic Logic and Mechanical Theorem Proving. Academic Press, 1973."},{"key":"21_CR4","unstructured":"H. Decker. On the declarative, operational and procedural semantics of disjunctive computational theories. In Proc. Workshop on the Deductive Approach to Information Systems and Databases, Spain, 1991."},{"key":"21_CR5","unstructured":"J.A. Fernandez and J. Minker. Bottom-up evaluation of hierarchical disjunctive deductive databases. In Koichi Furukawa, editor, Proc. 8th International Conference on Logic Programming, pages 660\u2013675, 91."},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"U. Furbach. Answers for disjunctive logic programs. In T. Christaller, editor, Proc. of the GWAI'91, pages 23\u201332. Springer, Informatik Fachberichte 285, 1991.","DOI":"10.1007\/978-3-662-02711-0_3"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"U. Furbach. Splitting as a source of parallelism in disjunctive logic programs. Technical Report 8\/91, Universit\u00e4t Koblenz, 1991. Also in Proc. of the IJCAI-Workshop PPAI'91.","DOI":"10.1007\/978-3-662-02711-0_3"},{"issue":"4","key":"21_CR8","first-page":"295","volume":"1","author":"H. Herre","year":"1988","unstructured":"H. Herre. Negation and constructivity in logic programming. J. New Gener. Comput. Syst., 1(4):295\u2013305, 1988.","journal-title":"J. New Gener. Comput. Syst."},{"key":"21_CR9","unstructured":"D.W. Loveland. Automated Theorem Proving: A logical basis. North-Holland, 1978."},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"D.W. Loveland. Near-Horn Prolog. In J.-L. Lassez, editor, Proc. of the 4th Int. Conf. on Logic Programming, pages 456\u2013469. The MIT Press, 1987.","DOI":"10.21236\/ADA185172"},{"key":"21_CR11","unstructured":"D.W. Loveland and D.W. Reed. A near-horn prolog for compilation. Technical report cs-1989\u201314, Duke University, 1990."},{"key":"21_CR12","unstructured":"R. Letz, J. Schumann, S. Bayerl, and W. Bibel. SETHEO: A High-Performance Theorem Prover. Technical report, ATP-Report, Technische Universit\u00e4t M\u00fcnchen, 1989. To appear in Journal of Automated Reasoning."},{"key":"21_CR13","doi-asserted-by":"crossref","unstructured":"J. Minker and A. Rajasekar. Procedural interpretation of non-horn logic programs. In Lusk and Overbeek, editors, Proc. of the 9th CADE, pages 279\u2013293. Springer LNCS 310, 1988.","DOI":"10.1007\/BFb0012837"},{"key":"21_CR14","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0743-1066(90)90033-2","volume":"9","author":"J. Minker","year":"1990","unstructured":"J. Minker and A. Rajasekar, A fixpoint semantics for disjunctive logic programs. J. Logic Programming, 9:45\u201374, 1990.","journal-title":"J. Logic Programming"},{"key":"21_CR15","unstructured":"D.W. Reed, D.W. Loveland, and B.T. Smith. An alternative characterization of disjunctive logic programs. Technical Report CS-1991-11, Duke Univerity, 1991."},{"key":"21_CR16","doi-asserted-by":"crossref","unstructured":"T. Wakayama and T.H. Payne. Case inference in resolution-based languages. In Lusk and Overbeek, editors, Proc. of the 9th CADE, pages 313\u2013322. Springer LNCS 310, 1988.","DOI":"10.1007\/BFb0012839"}],"container-title":["Lecture Notes in Computer Science","Logics in AI"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0023438.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:50:11Z","timestamp":1607550611000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0023438"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354055887X"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/bfb0023438","relation":{},"subject":[]}}