| 2007 |
|---|
| 40 | EE | Wlodzimierz Drabent,
Jakob Henriksson,
Jan Maluszynski:
HD-rules: A Hybrid System Interfacing Prolog with DL-reasoners.
ALPSWS 2007 |
| 39 | EE | Wlodzimierz Drabent,
Jan Maluszynski:
Well-Founded Semantics for Hybrid Rules.
RR 2007: 1-15 |
| 38 | EE | Wlodzimierz Drabent,
Jakob Henriksson,
Jan Maluszynski:
Hybrid Reasoning with Rules and Constraints under Well-Founded Semantics.
RR 2007: 348-357 |
| 37 | EE | Wlodzimierz Drabent,
Artur Wilk:
Extending XML Query Language Xcerpt by Ontology Queries.
Web Intelligence 2007: 447-451 |
| 2006 |
|---|
| 36 | EE | Wlodzimierz Drabent:
Towards More Precise Typing Rules for.
PPSWR 2006: 120-133 |
| 35 | EE | Artur Wilk,
Wlodzimierz Drabent:
A Prototype of a Descriptive Type System for Xcerpt.
PPSWR 2006: 262-275 |
| 2005 |
|---|
| 34 | EE | Sacha Berger,
Emmanuel Coquery,
Wlodzimierz Drabent,
Artur Wilk:
Descriptive Typing Rules for Xcerpt.
PPSWR 2005: 85-100 |
| 33 | EE | Wlodzimierz Drabent:
Towards Types for Web Rule Languages.
Reasoning Web 2005: 305-317 |
| 32 | EE | Wlodzimierz Drabent,
Miroslawa Milkowska:
Proving Correctness and Completeness of Normal Programs - a Declarative Approach
CoRR abs/cs/0501043: (2005) |
| 31 | EE | Wlodzimierz Drabent,
Miroslawa Milkowska:
Proving correctness and completeness of normal programs - a declarative approach.
TPLP 5(6): 669-711 (2005) |
| 2004 |
|---|
| 30 | EE | François Bry,
Wlodzimierz Drabent,
Jan Maluszynski:
On Subtyping of Tree-Structured Data: A Polynomial Approach.
PPSWR 2004: 1-18 |
| 2003 |
|---|
| 29 | EE | Artur Wilk,
Wlodzimierz Drabent:
On Types for XML Query Language Xcerpt.
PPSWR 2003: 128-145 |
| 2002 |
|---|
| 28 | EE | Wlodzimierz Drabent,
Jan Maluszynski,
Pawel Pietrzak:
Using parametric set constraints for locating errors in CLP programs
CoRR cs.PL/0202010: (2002) |
| 27 | | Wlodzimierz Drabent,
Jan Maluszynski,
Pawel Pietrzak:
Using parametric set constraints for locating errors in CLP programs.
TPLP 2(4-5): 549-610 (2002) |
| 2001 |
|---|
| 26 | EE | Wlodzimierz Drabent,
Miroslawa Milkowska:
Proving Correctness and Completeness of Normal Programs - A Declarative Approach.
ICLP 2001: 284-299 |
| 25 | | Wlodzimierz Drabent,
Jan Maluszynski,
Pawel Pietrzak:
Parametric Descriptive Types for CLP.
JFPLC 2001: 239-256 |
| 2000 |
|---|
| 24 | | Wlodzimierz Drabent,
Jan Maluszynski,
Pawel Pietrzak:
Locating Type Errors in Untyped CLP Programs.
Analysis and Visualization Tools for Constraint Programming 2000: 121-150 |
| 1999 |
|---|
| 23 | | Marco Comini,
Wlodzimierz Drabent,
Pawel Pietrzak:
Diagnosis of CHIP Programs Using Type Information.
APPIA-GULP-PRODE 1999: 337-350 |
| 22 | | Wlodzimierz Drabent:
It Is Declarative.
ICLP 1999: 607 |
| 21 | EE | Wlodzimierz Drabent,
Jan Maluszynski,
Pawel Pietrzak:
Type-based Diagnosis of CLP Programs.
Electr. Notes Theor. Comput. Sci. 30(4): (1999) |
| 1998 |
|---|
| 20 | EE | Wlodzimierz Drabent,
Pawel Pietrzak:
Type Analysis for CHIP.
AMAST 1998: 389-405 |
| 1997 |
|---|
| 19 | EE | Johan Boye,
Wlodzimierz Drabent,
Jan Maluszynski:
Declarative Diagnosis of Contraint Programs: An Assertion-Based Approach.
AADEBUG 1997: 123-140 |
| 18 | EE | 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: 155-169 |
| 17 | | Germán Puebla,
Marco Comini,
Wlodzimierz Drabent,
Mireille Ducassé,
Massimo Fabris,
Christian Schulte:
Tools and Environments for (Constraint) Logic Programming (Workshop Overview).
ILPS 1997: 417-418 |
| 1996 |
|---|
| 16 | | Alessandra Di Pierro,
Wlodzimierz Drabent:
On Negation As Instantiation.
ALP 1996: 32-46 |
| 15 | | Alessandra Di Pierro,
Wlodzimierz Drabent:
On Quantified Negatives Queries.
APPIA-GULP-PRODE 1996: 179-190 |
| 14 | | Wlodzimierz Drabent:
Completeness of SLDNF-Resolution for Nonfloundering Queries.
J. Log. Program. 27(2): 89-106 (1996) |
| 1995 |
|---|
| 13 | | Wlodzimierz Drabent:
What is Failure? An Approach to Constructive Negation
Acta Inf. 32(1): 27-29 (1995) |
| 1993 |
|---|
| 12 | | Krzysztof Kuchcinski,
Wlodzimierz Drabent,
Jan Maluszynski:
Automatic Diagnosis of VLSI Digital Circuits Using Algorithmic Debugging.
AADEBUG 1993: 350-367 |
| 11 | | Wlodzimierz Drabent:
Completeness of SLDNF-Resolution for Non-Floundering Queries.
ILPS 1993: 643 |
| 10 | | Wlodzimierz Drabent:
SLS-Resolution without Floundering.
LPNMR 1993: 82-98 |
| 1992 |
|---|
| 9 | | Wlodzimierz Drabent:
What is Failure? Or: Constructive Negation by Fail Answers.
ICCI 1992: 62-66 |
| 1991 |
|---|
| 8 | | Wlodzimierz Drabent,
Maurizio Martelli:
Strict Completion of Logic Programs.
New Generation Comput. 9(1): 69-80 (1991) |
| 1988 |
|---|
| 7 | | Wlodzimierz Drabent,
Simin Nadjm-Tehrani,
Jan Maluszynski:
The Use of Assertions in Algorithmic Debugging.
FGCS 1988: 573-581 |
| 6 | | Wlodzimierz Drabent,
Simin Nadjm-Tehrani,
Jan Maluszynski:
Algorithmic Debugging with Assertions.
META 1988: 501-521 |
| 5 | | Wlodzimierz Drabent,
Jan Maluszynski:
Inductive Assertion Method for Logic Programs.
Theor. Comput. Sci. 59: 133-155 (1988) |
| 1987 |
|---|
| 4 | | Wlodzimierz Drabent:
Do Logic Programs Resemble Programs in Conventional Languages?
SLP 1987: 289-396 |
| 3 | | Wlodzimierz Drabent,
Jan Maluszynski:
Inductive Assertion Method for Logic Programs.
TAPSOFT, Vol.2 1987: 167-181 |
| 1986 |
|---|
| 2 | | Piotr Rudnicki,
Wlodzimierz Drabent:
Proving Properties of Pascal Programs in MIZAR 2.
Acta Inf. 22(6): 699-707 (1986) |
| 1985 |
|---|
| 1 | | Piotr Rudnicki,
Wlodzimierz Drabent:
Proving Properties of Pascal Programs in MIZAR 2.
Acta Inf. 22(3): 311-331 (1985) |
