Some of my papers

The eight papers I consider most important/interesting are marked below with (**) (1, 2, 3, 4, 5, 6, 7, 8).

Newer

Systematic construction of correct (and complete) logic programs, explained in one page.

W. Drabent (2023). A relaxed condition for avoiding the occur-check. Theoretical Computer Science Volume 975, 114107. DOI:10.1016/j.tcs.2023.114107.

W. Drabent (2023). On Feasibility of Declarative Diagnosis. In Proceedings 39th International Conference on Logic Programming (ICLP 2023). Electronic Proceedings in Theoretical Computer Science 385:193-200. DOI: 10.4204/EPTCS.385.20. Poster. Errata.

W. Drabent (2023). Implementing backjumping by means of exception handling. Theory and Practice of Logic Programming, 23(4), 918-932 (2023 International Conference on Logic Programming). DOI: 10.1017/S1471068423000285.

W. Drabent (2022). On correctness and completeness of an n queens program. Theory and Practice of Logic Programming, 22(1):37-50. DOI: 10.1017/S1471068421000223. Abstract.

W. Drabent (2022). On Correctness of Normal Logic Programs. In Logic-Based Program Synthesis and Transformation. LOPSTR 2022. LNCS vol. 13474, pp. 142--154. Springer, Cham. DOI: 10.1007/978-3-031-16767-6_8. Slides.

W. Drabent (2022). S-semantics -- an example. In Logic-Based Program Synthesis and Transformation. LOPSTR 2021. LNCS vol. 13290, pp. 60-74. Springer, Cham. DOI: 10.1007/978-3-030-98869-2_4

W. Drabent (2020). The Prolog debugger and declarative programming. In: Gabbrielli M. (eds) Logic-Based Program Synthesis and Transformation. LOPSTR 2019. Lecture Notes in Computer Science, vol 12042. Springer. pp. 193-208. DOI: 10.1007/978-3-030-45260-5_12. (See also CoRR arXiv:1906.04765 [cs.LO].)
Complemented by: W. Drabent (2020). The Prolog debugger and declarative programming; examples. CoRR arXiv:2003.01422 [cs.LO].

(**) W. Drabent (2018). Logic + control: On program construction and verification. Theory and Practice of Logic Programming 18(1):1-29. DOI: 10.1017/S1471068417000047. Abstract, erratum. Also CoRR arXiv:1110.4978 [cs.LO]. (A substantially reworked former paper).

W. Drabent (2021). It is declarative! On practical declarative programming in Prolog. LOPSTR 2021 tutorial. Slides.

W. Drabent (2021). SLD-resolution without occur-check, an example. CoRR arXiv:2103.01911.

Journals

• W. Drabent (2023). A relaxed condition for avoiding the occur-check. See above.
• W. Drabent (2023). Implementing backjumping by means of exception handling. See above.
• W. Drabent (2022). On correctness and completeness of an n queens program. See above.
• W. Drabent (2018). Logic + control: On program construction and verification. See above.
• W. Drabent (2017). Proving completeness of logic programs with the cut. Formal Aspects of Computing 29(1),155-172. DOI: 10.1007/s00165-016-0392-0. Abstract. Available here. (Published on-line in September 2016.)
• (**) W. Drabent (2016). Correctness and Completeness of Logic Programs. ACM Transactions on Computational Logic 17(3), Article 18 (May 2016), 32 pages. DOI: 10.1145/2898434. Abstract, erratum. A previous version in CoRR arXiv:1412.8739 [cs.LO].
• W. Drabent (2016). On definite program answers and least Herbrand models. Theory and Practice of Logic Programming 16(4):498-508. DOI: 10.1017/S1471068416000089. Abstract. © Cambridge University Press. (Also in CoRR arXiv:1503.03324v3 [cs.LO].)
• W. Drabent (2012). A Simple Correctness Proof for Magic Transformation. Theory and Practice of Logic Programming, 12(6):929-936. DOI:10.1017/S1471068411000032. © Cambridge University Press. (Abstract.) Published online in March 2011. Also available as arXiv:1012.2299v1 at CoRR.
• (**) W. Drabent, J. Małuszyński (2010). Hybrid Rules with Well-Founded Semantics. Knowledge and Information Systems, 25(1):137-168. Also published electronically (free of charge). DOI: 10.1007/s10115-010-0300-5.
• (**) W. Drabent, M. Miłkowska (2005). Proving Correctness and Completeness of Normal Programs - a Declarative Approach. Theory and Practice of Logic Programming, 5(6):669-711, 2005. DOI: 10.1017/S147106840500253X. Also available from CoRR.
• W. Drabent, J. Małuszyński, P. Pietrzak (2002). Using parametric set constraints for locating errors in CLP programs. Theory and Practice of Logic Programming, Vol 2(4&5) pp 549-610. Available from CoRR. Minor erratum).
• W. Drabent, J. Małuszyński, P. Pietrzak (2000). Type-based Diagnosis of CLP Programs. Electronic Notes in Theoretical Computer Science, 30(4):215-234, 2000. DOI:10.1016/S1571-0661(05)80659-0
• (**) Drabent, W. (1997). A Floyd-Hoare Method for Prolog. Linköping Electronic Articles in Computer and Information Science (ISSN 1401-9841). Vol.2 (1997): nr 013. (Abstract). Former version presented at a post-conference workshop "Verification and Analysis of Logic Programs" at JICSLP '96. (PDF)
• (**) Drabent, W. (1996). Completeness of SLDNF-resolution for non-floundering queries. The Journal of Logic Programming, 27(2):89-106 (May, 1996). DOI:10.1016/0743-1066(95)00118-2 (Postscript , Abstract).
• (**) Drabent, W. (1995). What is failure? An Approach to Constructive Negation. Acta Informatica, 32(1):27-59. DOI:10.1007/BF01185404 (PDF, Abstract).
• Drabent, W. and Martelli, M. (1991). Strict Completion of Logic Programs. New Generation Computing, 9:69-79.
• (**) Drabent, W. and Małuszyński, J. (1988). Inductive Assertion Method for Logic Programs. Theoretical Computer Science, 59:133-155. DOI:10.1016/0304-3975(88)90099-0 (PDF, PDF - manuscript, Abstract). See also a report on completeness and an example proof here or below.)
• Rudnicki P. and Drabent W. (1985). Proving properties of Pascal programs in Mizar-2, Acta Informatica, vol.22, fasc.3 (1985), pp. 311-331, and fasc. 5 (1986), pp. 699-707.

Book chapters

• W. Drabent. Hybrid Reasoning with Non-Monotonic Rules. In Reasoning Web. Semantic Technologies for Software Engineering. 6th International Summer School 2010, Dresden, Germany, August 30 - September 3, 2010. Tutorial Lectures, Volume 6325 of LNCS, Springer-Verlag, pp. 28-61, 2010. DOI: 10.1007/978-3-642-15543-7_2.
• Drabent W., Eiter T., Ianni G., Krennwallner T., Lukasiewicz T., Małuszyński J. (2009). Hybrid Reasoning with Rules and Ontologies. Chapter 1 of Semantic Techniques for the Web. The REWERSE Perspective. Volume 5500 of LNCS, Springer-Verlag, pp. 1-49. DOI: 10.1007/978-3-642-04581-3_1
• W. Drabent (2005). Towards Types for Web Rule Languages. In Reasoning Web, First International Summer School 2005, Volume 3564 of LNCS, Springer-Verlag. DOI: 10.1007/11526988_10.
• W. Drabent, J. Małuszyński, P. Pietrzak (2000). Locating Type Errors in Untyped CLP Programs. Chapter 4 in: M. Hermenegildo, P. Deransart, J. Małuszyński (eds.) Analysis and Visualization Tools for Constraint Programming, volume 1870 of LNCS,   pp.121-150, Springer-Verlag. DOI: 10.1007/10722311_5.
• Drabent, W., Nadjm-Tehrani, S., and Małuszyński, J. (1989). Algorithmic debugging with assertions. In H.Abramson and M.H.Rogers, editors, Meta-Programming in Logic Programming, chapter 26, pages 501-522. (C) The MIT Press. (PDF)

Conference proceedings etc

• W. Drabent (2023). On Feasibility of Declarative Diagnosis. ICLP 2023. See above (Newer).
• W. Drabent (2022). On Correctness of Normal Logic Programs. LOPSTR 2022. See above (Newer).
• W. Drabent (2022). S-semantics -- an example. LOPSTR 2021. See above (Newer).
• W. Drabent (2021). A note on occur-check. In Proceedings 37th International Conference on Logic Programming (Technical Communications), A. Formisano et al Eds. EPTCS (Electronic Proceedings in Theoretical Computer Science), vol 345. Open Publishing Association, 54-67. Abstract. DOI: 10.4204/EPTCS.345.17. Extended report arXiv:2204.05379 [cs.LO].

• W. Drabent (2020). The Prolog debugger and declarative programming. In: Gabbrielli M. (eds) Logic-Based Program Synthesis and Transformation. LOPSTR 2019. Lecture Notes in Computer Science, vol 12042. Springer. pp. 193-208. DOI: 10.1007/978-3-030-45260-5_12. (See also CoRR arXiv:1906.04765 [cs.LO].)
  Complemented by: W. Drabent (2020). The Prolog debugger and declarative programming; examples. CoRR arXiv:2003.01422 [cs.LO].
• W. Drabent (2015). On completeness of logic programs. In Logic Based Program Synthesis and Transformation, LOPSTR 2014. Revised Selected Papers, Lecture Notes in Computer Science, Vol. 8981, pp 261-278, Springer. DOI: 10.1007/978-3-319-17822-6_15. Presented at 24th LOPSTR. An extended version in CoRR http://arxiv.org/abs/1411.3015, 2014.
• W. Drabent (2012). Logic + control: An example. In Technical Communications of the 28th International Conference on Logic Programming (ICLP'12). Leibniz International Proceedings in Informatics (LIPIcs), 17:301-311. (Abstract and PDF, slides, slides 4 per page).
  Extended report (2012): Logic + control: An example of program construction, at CoRR.

  Preliminary version: SAT solver of Howe & King as a logic program. Logic Programming Newsletter, 24(2), June 2011. Important erratum, HTML.

• W. Drabent, A. Wilk. Extending XML Query Language Xcerpt by Ontology Queries. WI'07 (2007 IEEE/WIC/ACM International Conference on Web Intelligence, Main Conference Proceedings), pp 447-451. IEEE Computer Society 2007, ISBN 0-7695-3026-5, DOI: 10.1109/WI.2007.128.
  Full version (REWERSE technical report).
• W. Drabent, J. Henriksson, J. Małuszyński. HD-rules: a hybrid system interfacing Prolog with DL-reasoners. Presented at ALPSWS 2007 (2nd Workshop on Applications of Logic Programming to the Web, Semantic Web and Semantic Web Services, September 2007, held at ICLP 2007 - 23rd International Conference on Logic Programming), Proceedings. A slightly corrected version available here.
• W. Drabent, J. Małuszyński. Well-Founded Semantics for Hybrid Rules. In Web Reasoning and Rule Systems, Proceedings RR 2007 Volume 4524 of LNCS, Springer-Verlag, pp. 1-15. An extended version is available.
• W. Drabent, J. Henriksson, J. Małuszyński. Hybrid Reasoning with Rules and Constraints under Well-Founded Semantics. In Web Reasoning and Rule Systems, Proceedings RR 2007 Volume 4524 of LNCS, Springer-Verlag, pp. 348-357.
  Best short paper award at RR 2007.
• W. Drabent, A. Wilk. Combining XML querying with ontology reasoning: Xcerpt and DIG. Presented at "RuleML-06 Workshop: Ontology and Rule Integration", Athens, Georgia, U.S.A., 10-11 November 2006. Unpublished proceedings.
• W. Drabent (2006). Towards more precise typing rules for Xcerpt. In Proceedings of 4th Workshop on Principles and Practice of Semantic Web Reasoning (PPSWR06), Budva, Montenegro (10th - 11th June 2006). Volume 4187 of LNCS, Springer-Verlag. Available at http://dx.doi.org/10.1007/11853107_9.
• A. Wilk, W. Drabent (2006). A Prototype of a Descriptive Type System for Xcerpt. In Proceedings of 4th Workshop on Principles and Practice of Semantic Web Reasoning (PPSWR06), Budva, Montenegro (10th - 11th June 2006). Volume 4187 of LNCS, Springer-Verlag. Available at http://dx.doi.org/10.1007/11853107_21.
• S. Berger, E. Coquery, W. Drabent, A. Wilk (2005). Descriptive Typing Rules for Xcerpt. In Principles and Practice of Semantic Web Reasoning; Third International Workshop, PPSWR 2005, Volume 3703 of LNCS, Springer-Verlag, pp. 85-100. Available here.
  Extended version (technical report) available here.
  Erratum available here.
• F. Bry, W. Drabent, J. Małuszyński (2004). On Subtyping of Tree-structured Data: A Polynomial Approach. In proceedings of PPSWR 2004: Principles and Practice of Semantic Web Reasoning. PPSWR 2004. & & Volume 3208 of LNCS, Springer-Verlag, pp 1-18. DOI: 10.1007/978-3-540-30122-6_1
• A. Wilk, W. Drabent (2003). On Types for XML Query Language Xcerpt. In proceedings of PPSWR 2003 (Principles and Practice of Semantic Web Reasoning), ed. F. Bry, N. Henze, J. Małuszyński, Springer-Verlag LNCS vol. 2901, pp. 128-145. ISBN: 3-540-20582-9
• W. Drabent, M. Miłkowska (2001). Proving Correctness and Completeness of Normal Programs - a Declarative Approach. In Logic Programming, 17th International Conference, ICLP 2001, Paphos, Cyprus, November 26 - December 1, 2001. Proceedings , ed. Codognet, P., Springer-Verlag LNCS 2237, pp. 284-299. (Abstract. Postscript, Copyright Springer-Verlag 2001. )
• W. Drabent, J. Małuszyński, P. Pietrzak (2001). Parametric Descriptive Types for (C)LP. In: Programmation en logique avec contraintes, JFPLC'2001, Coordonnateur: Philippe Codognet, pp. 239-254, Hermes Science Publications, Paris, 2001.
• W. Drabent (1999). It Is Declarative: On Reasoning about Logic Programs (poster abstract). Logic Programming: Proceedings of the 1999 International Conference on Logic Programming, ed. D. De Schreye, p 607. The MIT Press, 1999. (The poster PDF, Postscript. See also the corresponding report, which is the 1999 version of (Drabent 1997) below PDF, Postscript. )
• Drabent, W., Pietrzak, P. (1998). Type Analysis for CHIP. Proc. Seventh International Conference on Algebraic Methodology and Software Technology (AMAST'98), ed. A. M. Haeberer, Springer-Verlag LNCS 1548, pp. 389-405. (Postscript).
• Drabent, W. (1997). It Is Declarative. On Reasoning about Logic Programs. Presented at ``Verification, Model Checking and Abstract Interpretation'', a post-conference workshop at International Logic Programming Symposium, Port Jefferson, October 1997. (Postscript, Abstract; Updated version of May 1999 PDF, Postscript).
• Boye, J., Drabent, W. and Małuszyński, J. (1997). Declarative Diagnosis of Constraint Programs: an Assertion Based Approach. In Proceedings of AADEBUG'97 (Third International Workshop on Automated Debugging, Linköping, Sweden), 1997. Linköping University Electronic Press. (http://www.ep.liu.se/ea/cis/1997/009/11/)
• Di Pierro, A. and Drabent, W. (1996). On Negation As Instantiation. Proc. Fifth International Conference on Algebraic and Logic Programming (ALP'96) . Lecture Notes in Computer Science 1139, pages 32-46. Springer-Verlag, 1996. (The published version, Updated version, Abstract).
• Drabent, W. (1993). SLS-resolution Without Floundering. In Pereira, L. M. and Nerode, A., editors, Proc. 2nd International Workshop on Logic Programming and Non-Monotonic Reasoning, pages 82-98. MIT Press. (PDF).
• W. Drabent, S. Nadjm-Tehrani, J. Małuszyński (1988). The Use of Assertions in Algorithmic Debugging. In Proc. of Fifth Generation Computer Systems 88, pages 573--581, 1988.
• Drabent, W. and Małuszyński, J. (1987). Inductive Assertion Method for Logic Programs. TAPSOFT '87 (Proceedings of the International Joint Conference on Theory and Practice of Software Development) Vol.2, Springer-Verlag LNCS 250, pp. 167-181.
• Drabent, W. (1987). Do Logic Programs Resemble Programs in Conventional Languages? Proceedings of the 1987 Symposium on Logic Programming, pages 389-396. IEEE Press. (PDF), (Postscript).

Others

• W. Drabent (2017): Wnioskowanie o programach w programowaniu w logice. 2017-01-23. (Reasoning about logic programs, seminar slides, mainly in Polish) slajdy, 4 na stronę, streszczenie.
• W. Drabent, A. Wilk (2007). Type Inference and Rule Dependencies in Xcerpt. REWERSE technical report REWERSE-TR-2007-08. (Complete Text, Abstract, bibtex, etc.)
• Cirstea, H., Coquery, E., Drabent, W., Fages, F., Kirchner, C., Małuszyński, J. Wack, B. (2004). Types for Web Rule Languages: a preliminary study. REWERSE deliverable.
• Drabent, W. (1994). A Proof Using the Inductive Assertion Method. Unpublished report.
• Drabent, W. (1988). On Completeness of the Inductive Assertion Method for Logic Programs. Unpublished note, Institute of Computer Science, Polish Academy of Sciences. Click here.
• Drabent, W. (1985). An experiment with domain construction for denotational semantics. Technical Report LiTH-IDA-R-85-17, Linköping University, Department of Computer and Information Science, December 1985. ISSN-0281-4250. (A personal rediscovery of Scott's information systems.) (Scan PDF).

(Partial) list of (older) references (BiBTeX)