The six papers I consider most important/interesting are marked below with (**) (1, 2,3,4, 5, 6).
(**) W. Drabent, J. Maluszynski (2009). Hybrid Rules with Well-Founded Semantics. Knowledge and Information Systems, in print. Also published electronically. DOI: 10.1007/s10115-010-0300-5.
Drabent W., Eiter T., Ianni G., Krennwallner T., Lukasiewicz T., Maluszynki 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.
(**) W. Drabent, M. Milkowska (2005). Proving Correctness and Completeness of Normal Programs - a Declarative Approach. Theory and Practice of Logic Programming, 5(6):669-711, 2005. Available from CoRR.
W. Drabent, J. Maluszynski, 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.
W. Drabent, J. Maluszynski, P. Pietrzak (2000). Locating Type Errors in Untyped CLP Programs. Chapter 4 in: M. Hermenegildo, P. Deransart, J. Maluszynski (eds.) Analysis and Visualization Tools for Constraint Programming, volume 1870 of LNCS pp.121-150, Springer-Verlag.
W. Drabent and J. Maluszynski and P. Pietrzak (2000). Type-based Diagnosis of CLP Programs. Electronic Notes in Theoretical Computer Science, 30(4), 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. (Postscript)
(**) Drabent, W. (1996). Completeness of SLDNF-resolution for non-floundering queries. The Journal of Logic Programming, 27(2):89-106 (May, 1996). (Postscript , Abstract).
(**) Drabent, W. (1995). What is failure? An Approach to Constructive Negation. Acta Informatica, 32(1):27-59. (Postscript , Abstract).
Drabent, W. and Martelli, M. (1991). Strict Completion of Logic Programs. New Generation Computing, 9:69-79.
Drabent, W., Nadjm-Tehrani, S., and Maluszynski, J. (1989). Algorithmic debugging with assertions. In H.Abramson and M.H.Rogers, editors, Meta-programming in Logic Programming, chapter 26, pages 501-522. The MIT Press.
(**) Drabent, W. and Maluszynski, J. (1988). Inductive Assertion Method for Logic Programs. Theoretical Computer Science, 59:133-155. (Postscript, Abstract, see also here).
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.
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.
Full
version (REWERSE technical report).
W. Drabent, J. Henriksson, J. Maluszynski. 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. Maluszynski. 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. Maluszynski.
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.
W. Drabent (2005). Towards Types for Web Rule Languages. In Reasoning Web, First International Summer School 2005, Volume 3564 of LNCS, Springer-Verlag. Available here.
F. Bry, W. Drabent, J. Maluszynski (2004). On Subtyping of Tree-structured Data: A Polynomial Approach. In proceedings of PPSWR 2004, & & Volume 3208 of LNCS, Springer-Verlag. Available here.
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. Maluszynski, Springer-Verlag LNCS vol. 2901, pp. 128-145. ISBN: 3-540-20582-9
W. Drabent, M. Milkowska (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. Maluszynski, 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, 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 Proving Partial Correctness of 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 Postscript).
Boye, J., Drabent, W. and Maluszynski, 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, Postscript, an 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. (Postscript), (PDF).
W. Drabent, S. Nadjm-Tehrani, J. Maluszynski (1988). The Use of Assertions in Algorithmic Debugging. In Proc. of Fifth Generation Computer Systems 88, pages 573--581, 1988.
Drabent, W. and Maluszynski, 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 1987 Symposium on Logic Programming, pages 389-396. IEEE Press. (Postscript).
W. Drabent, A. Wilk (2007). Type Inference and Rule Dependencies in Xcerpt. REWERSE technical report REWERSE-TR-2007-08. Abstract, bibtex, etc. Complete Text.
Drabent, W. (1994). A Proof Using the Inductive Assertion Method. Unpublished report. (Abstract, PDF, Postscript).
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.) (PDF).
(Partial) list of (older) references (BiBTeX)
My e-mail addresses can be found in most of my papers above.