{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:21:37Z","timestamp":1725664897263},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540617082"},{"type":"electronic","value":"9783540706694"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61708-6_42","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:14:17Z","timestamp":1330276457000},"page":"19-23","source":"Crossref","is-referenced-by-count":1,"title":["DisLoP: A disjunctive logic programming system based on PROTEIN theorem prover"],"prefix":"10.1007","author":[{"given":"Chandrabose","family":"Aravindan","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"3_CR1","volume-title":"Technical Report 9-96","author":"C Aravindan","year":"1996","unstructured":"Aravindan, C: An abductive framework for negation in disjunctive logic programming. Technical Report 9-96, Universit\u00e4t Koblenz-Landau, Koblenz, Germany, 1996. (to appear in proc. of JELIA'96)"},{"key":"3_CR2","unstructured":"Baumgartner, P.: Refinements of theory model elimination and a variant without contrapositives. In: A.G. Cohn (ed.), Proc. of ECAI '94, Wiley, 1994."},{"key":"3_CR3","unstructured":"Baumgartner, P., Furbach, U.: PROTEIN: A PROver with a Theory Extension\/INterface. In: A. Bundy (ed.), Proc. of CADE-12, LNAI 814, Springer-Verlag, 1994, pp. 769\u2013773."},{"key":"3_CR4","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/BF00881948","volume":"13","author":"P. Baumgartner","year":"1994","unstructured":"Baumgartner, P., Furbach, U.: Model elimination without contrapositives and its application to PTTP. Journal of automated reasoning, 13:339\u2013359, 1994.","journal-title":"Journal of automated reasoning"},{"key":"3_CR5","volume-title":"Technical Report 8-96","author":"P. Baumgartner","year":"1996","unstructured":"Baumgartner, P., Furbach, U., Niemel\u00e4, I.: Hyper Tableau. Technical Report 8-96, Universit\u00e4t Koblenz-Landau, Koblenz, Germany, 1996. (to appear in proc. of JELIA'96)"},{"key":"3_CR6","unstructured":"Baumgartner, P., Furbach, U., Stolzenburg, F.: Model elimination, Logic programming, and Computing answers. In: Proc. of IJCAI '95, Vol. 1, 1995. (to appear in Artificial Intelligence)"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Baumgartner, P., Stolzenburg, F.: Constraint model elimination and a PTTP implementation. In: Proc. of the 4th workshop on theorem proving with analytic tableaux and related methods, LNAI 918, Springer-Verlag, 1995, pp. 201\u2013216.","DOI":"10.1007\/3-540-59338-1_37"},{"key":"3_CR8","unstructured":"Brass, S., Dix, J.: Disjunctive semantics based upon partial and bottom-up evaluation. In: Proc. of the 12th int. conf. on logic programming, MIT Press, 1995, pp. 199\u2013213."},{"key":"3_CR9","unstructured":"Brass, S., Dix, J.: Characterizing D-WFS: Confluence and iterated GCWA. To appear in proc. of JELIA'96."},{"key":"3_CR10","volume-title":"Technical report 4-96","author":"S. Brass","year":"1996","unstructured":"Brass, S., Dix, J., Przymusinski, T.: Characterizations and implementation of static semantics of disjunctive programs. Technical report 4-96, Universit\u00e4t Koblenz-Landau, Koblenz, Germany, 1996."},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Lobo, J., Minker, J., Rajasekar, A.: Foundations of disjunctive logic programming. MIT Press, 1992.","DOI":"10.1016\/B978-0-12-450010-5.50022-0"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Niemel\u00e4, I.: A tableau calculus for minimal model reasoning. In: Proc. of the 5th workshop on theorem proving with analytic tableaux and related methods, LNAI 1071, Springer-Verlag, 1996, pp. 278\u2013294.","DOI":"10.1007\/3-540-61208-4_18"},{"key":"3_CR13","volume-title":"Technical report 6-96","author":"I. Niemel\u00e4","year":"1996","unstructured":"Niemel\u00e4, I.: Implementing circumscription using a tableau calculus. Technical report 6-96, Universit\u00e4t Koblenz-Landau, Koblenz, Germany, 1996. (to appear in proc. of ECAI '96)"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Przymusinski, T.: Static semantics for normal and disjunctive logic programs. Annals of mathematics and artificial intelligence, Special issue on disjunctive programs, 1995.","DOI":"10.1007\/BF01530826"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Smullyan, R. M.: First-Order Logic. Springer-Verlag, 1968.","DOI":"10.1007\/978-3-642-86718-7"}],"container-title":["Lecture Notes in Computer Science","KI-96: Advances in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61708-6_42.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:09:31Z","timestamp":1605629371000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61708-6_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540617082","9783540706694"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-61708-6_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}