Wlodzimierz Drabent

Publication Activity (10 Years)

Years Active: 1985-2023
Publications (10 Years): 22

Top Topics

Top Venues

Theory Pract. Log. Program.

Formal Aspects Comput.

Publications

Wlodzimierz Drabent
A relaxed condition for avoiding the occur-check. Theor. Comput. Sci. 975 (2023)
Wlodzimierz Drabent
On Feasibility of Declarative Diagnosis. CoRR (2023)
Wlodzimierz Drabent
Implementing backjumping by means of exception handling. CoRR (2023)
Wlodzimierz Drabent
Implementing Backjumping by Means of Exception Handling. Theory Pract. Log. Program. 23 (4) (2023)
Wlodzimierz Drabent
On Correctness of Normal Logic Programs. LOPSTR (2022)
Wlodzimierz Drabent
A note on occur-check (extended report). CoRR (2022)
Wlodzimierz Drabent
On Correctness and Completeness of an n Queens Program. Theory Pract. Log. Program. 22 (1) (2022)
Wlodzimierz Drabent
S-Semantics-an Example. LOPSTR (2021)
Wlodzimierz Drabent
On correctness and completeness of an n queens program. CoRR (2021)
Wlodzimierz Drabent
A Note on Occur-Check. ICLP Technical Communications (2021)
Wlodzimierz Drabent
SLD-resolution without occur-check, an example. CoRR (2021)
Wlodzimierz Drabent
S-semantics - an example. CoRR (2020)
Wlodzimierz Drabent
The Prolog Debugger and Declarative Programming. Examples. CoRR (2020)
Wlodzimierz Drabent
Implementing backjumping by throw/1 and catch/3 of Prolog. CoRR (2020)
Wlodzimierz Drabent
The Prolog Debugger and Declarative Programming. LOPSTR (2019)
Wlodzimierz Drabent
On correctness of an n queens program. CoRR (2019)
Wlodzimierz Drabent
The Prolog debugger and declarative programming. CoRR (2019)
Wlodzimierz Drabent
Logic + control: On program construction and verification. Theory Pract. Log. Program. 18 (1) (2018)
Wlodzimierz Drabent
Proving completeness of logic programs with the cut. Formal Aspects Comput. 29 (1) (2017)
Wlodzimierz Drabent
Proving completeness of logic programs with the cut. CoRR (2016)
Wlodzimierz Drabent
On definite program answers and least Herbrand models. Theory Pract. Log. Program. 16 (4) (2016)
Wlodzimierz Drabent
Correctness and Completeness of Logic Programs. ACM Trans. Comput. Log. 17 (3) (2016)
Wlodzimierz Drabent
On definite program answers and least Herbrand models. CoRR (2015)
Wlodzimierz Drabent
On Completeness of Logic Programs. LOPSTR (2014)
Wlodzimierz Drabent
Correctness and completeness of logic programs. CoRR (2014)
Wlodzimierz Drabent
On completeness of logic programs. CoRR (2014)
Wlodzimierz Drabent
Logic + control: An example. ICLP (Technical Communications) (2012)
Wlodzimierz Drabent
A simple correctness proof for magic transformation. Theory Pract. Log. Program. 12 (6) (2012)
Wlodzimierz Drabent
Logic + control: An example of program construction CoRR (2011)
Wlodzimierz Drabent, Jan Maluszynski
Hybrid rules with well-founded semantics. Knowl. Inf. Syst. 25 (1) (2010)
Wlodzimierz Drabent
Hybrid Reasoning with Non-monotonic Rules. Reasoning Web (2010)
Wlodzimierz Drabent
A Simple Correctness Proof for Magic Transformation CoRR (2010)
Wlodzimierz Drabent, Jan Maluszynski
Hybrid Rules with Well-Founded Semantics CoRR (2009)
Wlodzimierz Drabent, Artur Wilk
Extending XML Query Language Xcerpt by Ontology Queries. Web Intelligence (2007)
Wlodzimierz Drabent, Jakob Henriksson, Jan Maluszynski
Hybrid Reasoning with Rules and Constraints under Well-Founded Semantics. RR (2007)
Wlodzimierz Drabent, Jan Maluszynski
Well-Founded Semantics for Hybrid Rules. RR (2007)
Wlodzimierz Drabent, Jakob Henriksson, Jan Maluszynski
HD-rules: A Hybrid System Interfacing Prolog with DL-reasoners. ALPSWS (2007)
Artur Wilk, Wlodzimierz Drabent
A Prototype of a Descriptive Type System for Xcerpt. PPSWR (2006)
Wlodzimierz Drabent
Towards More Precise Typing Rules for. PPSWR (2006)
Sacha Berger, Emmanuel Coquery, Wlodzimierz Drabent, Artur Wilk
Descriptive Typing Rules for Xcerpt. PPSWR (2005)
Wlodzimierz Drabent, Miroslawa Milkowska
Proving correctness and completeness of normal programs - a declarative approach. Theory Pract. Log. Program. 5 (6) (2005)
Wlodzimierz Drabent
Towards Types for Web Rule Languages. Reasoning Web (2005)
Wlodzimierz Drabent, Miroslawa Milkowska
Proving Correctness and Completeness of Normal Programs - a Declarative Approach CoRR (2005)
François Bry, Wlodzimierz Drabent, Jan Maluszynski
On Subtyping of Tree-Structured Data: A Polynomial Approach. PPSWR (2004)
Artur Wilk, Wlodzimierz Drabent
On Types for XML Query Language Xcerpt. PPSWR (2003)
Wlodzimierz Drabent, Jan Maluszynski, Pawel Pietrzak
Using parametric set constraints for locating errors in CLP programs. Theory Pract. Log. Program. 2 (4-5) (2002)
Wlodzimierz Drabent, Jan Maluszynski, Pawel Pietrzak
Using parametric set constraints for locating errors in CLP programs CoRR (2002)
Wlodzimierz Drabent, Jan Maluszynski, Pawel Pietrzak
Parametric Descriptive Types for CLP. JFPLC (2001)
Wlodzimierz Drabent, Miroslawa Milkowska
Proving Correctness and Completeness of Normal Programs - A Declarative Approach. ICLP (2001)
Wlodzimierz Drabent, Jan Maluszynski, Pawel Pietrzak
Locating Type Errors in Untyped CLP Programs. Analysis and Visualization Tools for Constraint Programming (2000)
Wlodzimierz Drabent, Jan Maluszynski, Pawel Pietrzak
Type-based Diagnosis of CLP Programs. Electron. Notes Theor. Comput. Sci. 30 (4) (1999)
Marco Comini, Wlodzimierz Drabent, Pawel Pietrzak
Diagnosis of CHIP Programs Using Type Information. APPIA-GULP-PRODE (1999)
Wlodzimierz Drabent
It Is Declarative. ICLP (1999)
Wlodzimierz Drabent, Pawel Pietrzak
Type Analysis for CHIP. AMAST (1998)
Francisco Bueno, Pierre Deransart, Wlodzimierz Drabent, Gérard Ferrand, Manuel V. Hermenegildo, Jan Maluszynski, Germán Puebla
On the Role of Semantic Approximations on Validation and Diagnosis of Contraint Logic Programs. AADEBUG (1997)
Johan Boye, Wlodzimierz Drabent, Jan Maluszynski
Declarative Diagnosis of Contraint Programs: An Assertion-Based Approach. AADEBUG (1997)
Germán Puebla, Marco Comini, Wlodzimierz Drabent, Mireille Ducassé, Massimo Fabris, Christian Schulte
Tools and Environments for (Constraint) Logic Programming (Workshop Overview). ILPS (1997)
Wlodzimierz Drabent
Completeness of SLDNF-Resolution for Nonfloundering Queries. J. Log. Program. 27 (2) (1996)
Alessandra Di Pierro, Wlodzimierz Drabent
On Negation As Instantiation. ALP (1996)
Alessandra Di Pierro, Wlodzimierz Drabent
On Quantified Negatives Queries. APPIA-GULP-PRODE (1996)
Wlodzimierz Drabent
What is Failure? An Approach to Constructive Negation. Acta Informatica 32 (1) (1995)
Wlodzimierz Drabent
SLS-Resolution without Floundering. LPNMR (1993)
Wlodzimierz Drabent
Completeness of SLDNF-Resolution for Non-Floundering Queries. ILPS (1993)
Krzysztof Kuchcinski, Wlodzimierz Drabent, Jan Maluszynski
Automatic Diagnosis of VLSI Digital Circuits Using Algorithmic Debugging. AADEBUG (1993)
Wlodzimierz Drabent
What is Failure? Or: Constructive Negation by Fail Answers. ICCI (1992)
Wlodzimierz Drabent, Maurizio Martelli
Strict Completion of Logic Programs. New Gener. Comput. 9 (1) (1991)
Wlodzimierz Drabent, Simin Nadjm-Tehrani, Jan Maluszynski
Algorithmic Debugging with Assertions. META (1988)
Wlodzimierz Drabent, Simin Nadjm-Tehrani, Jan Maluszynski
The Use of Assertions in Algorithmic Debugging. FGCS (1988)
Wlodzimierz Drabent, Jan Maluszynski
Inductive Assertion Method for Logic Programs. Theor. Comput. Sci. 59 (1988)
Wlodzimierz Drabent, Jan Maluszynski
Inductive Assertion Method for Logic Programs. TAPSOFT, Vol.2 (1987)
Wlodzimierz Drabent
Do Logic Programs Resemble Programs in Conventional Languages? SLP (1987)
Piotr Rudnicki, Wlodzimierz Drabent
Erratum: Proving Properties of Pascal Programs in MIZAR 2. Acta Informatica 22 (6) (1986)
Piotr Rudnicki, Wlodzimierz Drabent
Proving Properties of Pascal Programs in MIZAR 2. Acta Informatica 22 (3) (1985)