{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:24:28Z","timestamp":1761611068567},"reference-count":54,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1998,2,1]],"date-time":"1998-02-01T00:00:00Z","timestamp":886291200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,19]],"date-time":"2013-07-19T00:00:00Z","timestamp":1374192000000},"content-version":"vor","delay-in-days":5647,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Journal of Logic Programming"],"published-print":{"date-parts":[[1998,2]]},"DOI":"10.1016\/s0743-1066(97)00074-5","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T23:53:40Z","timestamp":1051142020000},"page":"111-167","source":"Crossref","is-referenced-by-count":49,"title":["SLDNFA: An abductive procedure for abductive logic programs"],"prefix":"10.1016","volume":"34","author":[{"given":"Marc","family":"Denecker","sequence":"first","affiliation":[]},{"given":"Danny","family":"de Schreye","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0743-1066(97)00074-5_BIB1","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0743-1066(94)90051-5","article-title":"A New Definition of SLDNF-Resolution","volume":"18","author":"Apt","year":"1994","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0743-1066(97)00074-5_BIB2","article-title":"Een implementatie van SLDNFA + CLP(R) en zijn toepassing voor het redeneren over continue verandering","author":"Bruneel","year":"1994"},{"key":"10.1016\/S0743-1066(97)00074-5_BIB3","series-title":"Proc. International Conference on Logic Programming","first-page":"561","article-title":"Intensional Updates: Abduction via Deduction","author":"Bry","year":"1990"},{"key":"10.1016\/S0743-1066(97)00074-5_BIB4","series-title":"Logic Programming. Proc. First and Second Russian Conferences on Logic Programming","first-page":"114","article-title":"Integrity Verification in Knowledge Bases","volume":"Vol. 592","author":"Bry","year":"1991"},{"key":"10.1016\/S0743-1066(97)00074-5_BIB5","series-title":"Proc. 5th International Conference on Logic Programming","article-title":"Constructive Negation Based on the Completed Database","author":"Chan","year":"1988"},{"key":"10.1016\/S0743-1066(97)00074-5_BIB6","series-title":"Introduction to Artificial Intelligence","author":"Charniak","year":"1985"},{"key":"10.1016\/S0743-1066(97)00074-5_BIB7","series-title":"Logic and Databases","first-page":"293","article-title":"Negation as Failure","author":"Clark","year":"1978"},{"key":"10.1016\/S0743-1066(97)00074-5_BIB8","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1093\/logcom\/1.5.661","article-title":"On the Relationship between Abduction and Deduction","volume":"1","author":"Console","year":"1991","journal-title":"J. Logic Computation"},{"key":"10.1016\/S0743-1066(97)00074-5_BIB9","series-title":"Proc. 8th International Conference on Automated Deduction","article-title":"Causes for Events: Their Computation and Application","volume":"230","author":"Cox","year":"1986"},{"key":"10.1016\/S0743-1066(97)00074-5_BIB10","article-title":"Knowledge Representation and Reasoning in Incomplete Logic Programming","author":"Denecker","year":"1993"},{"key":"10.1016\/S0743-1066(97)00074-5_BIB11","series-title":"International Conference on Logic Programming and Nonmonotonic Reasoning","first-page":"15","article-title":"A Terminological Interpretation of (Abductive) Logic Programming","volume":"Vol. 928","author":"Denecker","year":"1995"},{"key":"10.1016\/S0743-1066(97)00074-5_BIB12","series-title":"Their Soundness and Completeness","article-title":"A Family of Abductive Procedures for Normal Abductive Programs","author":"Denecker","year":"1992"},{"key":"10.1016\/S0743-1066(97)00074-5_BIB13","series-title":"Proc. International Joint Conference and Symposium on Logic Programming","first-page":"686","article-title":"SLDNFA: An Abductive Procedure for Normal Abductive Programs","author":"Denecker","year":"1992"},{"key":"10.1016\/S0743-1066(97)00074-5_BIB14","series-title":"Proc. Logic Programming and Nonmonotonic Reasoning Workshop","first-page":"365","article-title":"Justification Semantics: A Unifying Framework for the Semantics of Logic Programs","author":"Denecker","year":"1993"},{"key":"10.1016\/S0743-1066(97)00074-5_BIB15","series-title":"Proc. International Symposium on Logic Programming","first-page":"147","article-title":"Representing Incomplete Knowledge in Abductive Logic Programming","author":"Denecker","year":"1993"},{"key":"10.1016\/S0743-1066(97)00074-5_BIB16","series-title":"Reasoning in an Integration of Classical Logic and Logic Programming","author":"Denecker","year":"1995"},{"key":"10.1016\/S0743-1066(97)00074-5_BIB17","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1093\/logcom\/5.5.553","article-title":"Representing Incomplete Knowledge in Abductive Logic Programming","volume":"5","author":"Denecker","year":"1995","journal-title":"J. Logic Computation"},{"key":"10.1016\/S0743-1066(97)00074-5_BIB18","series-title":"Proc. European Conference on Artificial Intelligence","article-title":"Temporal Reasoning with Abductive Event Calculus","author":"Denecker","year":"1992"},{"key":"10.1016\/S0743-1066(97)00074-5_BIB19","doi-asserted-by":"crossref","DOI":"10.1007\/BF01185404","article-title":"What Is Failure? An Approach to Constructive Negation","author":"Drabent","year":"1993"},{"key":"10.1016\/S0743-1066(97)00074-5_BIB20","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/S0747-7171(85)80027-4","article-title":"Properties of Substitutions and Unifications","volume":"1","author":"Eder","year":"1985","journal-title":"J. Symbolic Computation"},{"key":"10.1016\/S0743-1066(97)00074-5_BIB21","series-title":"Proc. International Conference on Logic Programming","article-title":"Abductive Planning with Event Calculus","author":"Eshghi","year":"1988"},{"key":"10.1016\/S0743-1066(97)00074-5_BIB22","series-title":"Proc. International Conference on Logic Programming","article-title":"Abduction Compared with Negation as Failure","author":"Eshghi","year":"1989"},{"key":"10.1016\/S0743-1066(97)00074-5_BIB23","article-title":"Residue: A Deductive Approach to Design Synthesis","author":"Finger","year":"1985"},{"key":"10.1016\/S0743-1066(97)00074-5_BIB24","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/S0743-1066(85)80005-4","article-title":"A Kripke-Kleene Semantics for Logic Programs","volume":"2","author":"Fitting","year":"1985","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0743-1066(97)00074-5_BIB25","article-title":"An Abductive Proof Procedure Based on the Clark Completion","author":"Fung","year":"1995"},{"issue":"2","key":"10.1016\/S0743-1066(97)00074-5_BIB26","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/S0743-1066(97)00026-5","article-title":"The iff Proof Procedure for Abductive Logic Programming","volume":"33","author":"Fung","year":"1997","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0743-1066(97)00074-5_BIB27","series-title":"Proc. 9th International Joint Conference and Symposium on Logic Programming","article-title":"Describing Action and Change by Logic Programs","author":"Gelfond","year":"1992"},{"key":"10.1016\/S0743-1066(97)00074-5_BIB28","doi-asserted-by":"crossref","DOI":"10.1007\/BF03037523","article-title":"Updating Knowledge Bases ii","author":"Guessoum","year":"1990"},{"key":"10.1016\/S0743-1066(97)00074-5_BIB29","article-title":"Bottom-Up Abduction by Model Generation","author":"Inoue","year":"1993"},{"key":"10.1016\/S0743-1066(97)00074-5_BIB30","doi-asserted-by":"crossref","first-page":"719","DOI":"10.1093\/logcom\/2.6.719","article-title":"Abductive Logic Programming","volume":"2","author":"Kakas","year":"1993","journal-title":"J. Logic Computation"},{"key":"10.1016\/S0743-1066(97)00074-5_BIB31","series-title":"Proc. 16th Very Large Database Conference","first-page":"650","article-title":"Database Updates through Abduction","author":"Kakas","year":"1990"},{"key":"10.1016\/S0743-1066(97)00074-5_BIB32","series-title":"Proc. European Conference on Artificial Intelligence","article-title":"Generalised Stable Models: A Semantics for Abduction","author":"Kakas","year":"1990"},{"key":"10.1016\/S0743-1066(97)00074-5_BIB33","series-title":"Bibliotheca Mathematica","volume":"Vol. 1","author":"Kleene","year":"1952"},{"key":"10.1016\/S0743-1066(97)00074-5_BIB34","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0743-1066(87)90007-0","article-title":"Negation in Logic Programming","volume":"4","author":"Kunen","year":"1987","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0743-1066(97)00074-5_BIB35","series-title":"Foundations of Deductive Databases and Logic Programming","first-page":"587","article-title":"Unification Revisited","author":"Lassez","year":"1988"},{"key":"10.1016\/S0743-1066(97)00074-5_BIB36","article-title":"Partial Deduction of the Ground Representation and Its Application to Integrity Checking","author":"Leuschel","year":"1995"},{"key":"10.1016\/S0743-1066(97)00074-5_BIB37","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/0743-1066(87)90009-4","article-title":"Integrity Checking in Stratified Databases","volume":"4","author":"Lloyd","year":"1987","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0743-1066(97)00074-5_BIB38","series-title":"Foundations of Logic Programming","author":"Lloyd","year":"1987"},{"key":"10.1016\/S0743-1066(97)00074-5_BIB39","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0743-1066(84)90011-6","article-title":"Making Prolog More Expressive","volume":"1","author":"Lloyd","year":"1984","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0743-1066(97)00074-5_BIB40","series-title":"Proc. Third Annual Symposium on Logic in Computer Science","first-page":"348","article-title":"Complete Axiomatizations of the Algebras of Finite, Rational and Infinite Trees","author":"Maher","year":"1988"},{"key":"10.1016\/S0743-1066(97)00074-5_BIB41","series-title":"Proc. Conference on Automated Deduction","article-title":"Satchmo: A Theorem Prover Implemel ted in Prolog","author":"Manthey","year":"1988"},{"key":"10.1016\/S0743-1066(97)00074-5_BIB42","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1145\/357162.357169","article-title":"An Efficient Unification Algorithm","volume":"4","author":"Martelli","year":"1982","journal-title":"Trans. Programming Languages Syst."},{"key":"10.1016\/S0743-1066(97)00074-5_BIB43","first-page":"57","article-title":"A New SLDNF-Tree","volume":"43","author":"Martelli","year":"1992"},{"key":"10.1016\/S0743-1066(97)00074-5_BIB44","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1093\/logcom\/5.5.579","article-title":"CHICA, an Abductive Planning System Based on Event Calculus","volume":"5","author":"Missiaen","year":"1995","journal-title":"J. Logic Computation"},{"key":"10.1016\/S0743-1066(97)00074-5_BIB45","article-title":"Localized Abductive Planning with the Event Calculus","author":"Missiaen","year":"1991"},{"key":"10.1016\/S0743-1066(97)00074-5_BIB46","series-title":"Proc. 1991 IEEE Conference on Robotics and Automation","first-page":"605","article-title":"Localized Abductive Planning for Robot Assembly","author":"Missiaen","year":"1991"},{"key":"10.1016\/S0743-1066(97)00074-5_BIB47","series-title":"Proc. AAAI-82","first-page":"428","article-title":"The Role of Logic in Knowledge Representation and Commonsense Reasoning","author":"Moore","year":"1982"},{"key":"10.1016\/S0743-1066(97)00074-5_BIB48","series-title":"Philosophical Writings of Peirce","author":"Peirce","year":"1955"},{"key":"10.1016\/S0743-1066(97)00074-5_BIB49","series-title":"Proc. 3rd Scandinavian Conference on AI","article-title":"Hypothetical Reasoning with Well Founded Semantics","author":"Pereira","year":"1991"},{"key":"10.1016\/S0743-1066(97)00074-5_BIB50","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0004-3702(88)90077-X","article-title":"A Logical Framework for Default Reasoning","volume":"36","author":"Poole","year":"1988","journal-title":"Artif. Intelligence"},{"key":"10.1016\/S0743-1066(97)00074-5_BIB51","series-title":"Proc. International Joint Conference and Symposium on Logic Programming","article-title":"A Query Evaluation Method for Abductive Logic Programming","author":"Satoh","year":"1992"},{"key":"10.1016\/S0743-1066(97)00074-5_BIB52","series-title":"Proc. IJCAI89","first-page":"1055","article-title":"Prediction Is Deduction but Explanation Is Abduction","author":"Shanahan","year":"1989"},{"key":"10.1016\/S0743-1066(97)00074-5_BIB53","series-title":"First-Order Logic","author":"Smullyan","year":"1968"},{"key":"10.1016\/S0743-1066(97)00074-5_BIB54","series-title":"Proc. ILPS'93 Workshop on Logic Programming with Incomplete Information","first-page":"35","article-title":"Using SLDFA-Resolution with Abduction","author":"Teusink","year":"1993"}],"container-title":["The Journal of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743106697000745?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743106697000745?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T14:22:37Z","timestamp":1555424557000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0743106697000745"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,2]]},"references-count":54,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1998,2]]}},"alternative-id":["S0743106697000745"],"URL":"https:\/\/doi.org\/10.1016\/s0743-1066(97)00074-5","relation":{},"ISSN":["0743-1066"],"issn-type":[{"value":"0743-1066","type":"print"}],"subject":[],"published":{"date-parts":[[1998,2]]}}}