Wlodzimierz Drabent - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 54 from 54

2023

A relaxed condition for avoiding the occur-checkWlodzimierz Drabent. TCS, 975:114107, October 2023. [doi]

Implementing Backjumping by Means of Exception HandlingWlodzimierz Drabent. tplp, 23(4):918-932, July 2023. [doi]

2022

On Correctness and Completeness of an n Queens ProgramWlodzimierz Drabent. tplp, 22(1):37-50, 2022. [doi]

On Correctness of Normal Logic ProgramsWlodzimierz Drabent. LOPSTR 2022: 142-154 [doi]

2021

S-Semantics-an ExampleWlodzimierz Drabent. LOPSTR 2022: 60-74 [doi]

2019

The Prolog Debugger and Declarative ProgrammingWlodzimierz Drabent. LOPSTR 2020: 193-208 [doi]

2018

Logic + control: On program construction and verificationWlodzimierz Drabent. tplp, 18(1):1-29, 2018. [doi]

2017

Proving completeness of logic programs with the cutWlodzimierz Drabent. fac, 29(1):155-172, 2017. [doi]

2016

Correctness and Completeness of Logic ProgramsWlodzimierz Drabent. tocl, 17(3):18, 2016. [doi]

On definite program answers and least Herbrand modelsWlodzimierz Drabent. tplp, 16(4):498-508, 2016. [doi]

2014

On Completeness of Logic ProgramsWlodzimierz Drabent. LOPSTR 2015: 261-278 [doi]

2012

A simple correctness proof for magic transformationWlodzimierz Drabent. tplp, 12(6):929-936, 2012. [doi]

Logic + control: An exampleWlodzimierz Drabent. ICLP 2012: 301-311 [doi]

2010

Hybrid rules with well-founded semanticsWlodzimierz Drabent, Jan Maluszynski. kais, 25(1):137-168, 2010. [doi]

Hybrid Reasoning with Non-monotonic RulesWlodzimierz Drabent. rweb 2010: 28-61 [doi]

2009

Hybrid Reasoning with Rules and OntologiesWlodzimierz Drabent, Thomas Eiter, Giovambattista Ianni, Thomas Krennwallner, Thomas Lukasiewicz, Jan Maluszynski. In François Bry, Jan Maluszynski, editors, Semantic Techniques for the Web, The REWERSE Perspective. Volume 5500 of Lecture Notes in Computer Science, pages 1-49, Springer, 2009. [doi]

2007

2006

Towards More Precise Typing Rules forWlodzimierz Drabent. ppswr 2006: 120-133 [doi]

A Prototype of a Descriptive Type System for XcerptArtur Wilk, Wlodzimierz Drabent. ppswr 2006: 262-275 [doi]

2005

Descriptive Typing Rules for XcerptSacha Berger, Emmanuel Coquery, Wlodzimierz Drabent, Artur Wilk. ppswr 2005: 85-100 [doi]

Proving correctness and completeness of normal programs - a declarative approachWlodzimierz Drabent, Miroslawa Milkowska. tplp, 5(6):669-711, 2005. [doi]

Towards Types for Web Rule LanguagesWlodzimierz Drabent. rweb 2005: 305-317 [doi]

2004

On Subtyping of Tree-Structured Data: A Polynomial ApproachFrançois Bry, Wlodzimierz Drabent, Jan Maluszynski. ppswr 2004: 1-18 [doi]

2003

On Types for XML Query Language XcerptArtur Wilk, Wlodzimierz Drabent. ppswr 2003: 128-145 [doi]

2002

Using parametric set constraints for locating errors in CLP programsWlodzimierz Drabent, Jan Maluszynski, Pawel Pietrzak. tplp, 2(4-5):549-610, 2002.

2001

Proving Correctness and Completeness of Normal Programs - A Declarative ApproachWlodzimierz Drabent, Miroslawa Milkowska. ICLP 2001: 284-299 [doi]

Parametric Descriptive Types for CLPWlodzimierz Drabent, Jan Maluszynski, Pawel Pietrzak. jfplc 2001: 239-256

2000

Locating Type Errors in Untyped CLP ProgramsWlodzimierz Drabent, Jan Maluszynski, Pawel Pietrzak. discipl 2000: 121-150

1999

Diagnosis of CHIP Programs Using Type InformationMarco Comini, Wlodzimierz Drabent, Pawel Pietrzak. agp 1999: 337-350

Type-based Diagnosis of CLP ProgramsWlodzimierz Drabent, Jan Maluszynski, Pawel Pietrzak. TCS, 30(4):215-234, 1999. [doi]

It Is DeclarativeWlodzimierz Drabent. ICLP 1999: 607

1998

Type Analysis for CHIPWlodzimierz Drabent, Pawel Pietrzak. amast 1999: 389-405 [doi]

1997

1996

Completeness of SLDNF-Resolution for Nonfloundering QueriesWlodzimierz Drabent. jlp, 27(2):89-106, 1996.

On Negation As InstantiationAlessandra Di Pierro, Wlodzimierz Drabent. icalp 1996: 32-46

On Quantified Negatives QueriesAlessandra Di Pierro, Wlodzimierz Drabent. agp 1996: 179-190

1995

What is Failure? An Approach to Constructive NegationWlodzimierz Drabent. ACTA, 32(1):27-29, 1995.

1993

SLS-Resolution without FlounderingWlodzimierz Drabent. lpnmr 1993: 82-98

Completeness of SLDNF-Resolution for Non-Floundering QueriesWlodzimierz Drabent. SLP 1993: 643

Automatic Diagnosis of VLSI Digital Circuits Using Algorithmic DebuggingKrzysztof Kuchcinski, Wlodzimierz Drabent, Jan Maluszynski. AADEBUG 1993: 350-367

1992

What is Failure? Or: Constructive Negation by Fail AnswersWlodzimierz Drabent. icci 1992: 62-66

1991

Strict Completion of Logic ProgramsWlodzimierz Drabent, Maurizio Martelli. ngc, 9(1):69-80, 1991.

1988

Inductive Assertion Method for Logic ProgramsWlodzimierz Drabent, Jan Maluszynski. TCS, 59:133-155, 1988.

Algorithmic Debugging with AssertionsWlodzimierz Drabent, Simin Nadjm-Tehrani, Jan Maluszynski. meta 1988: 501-521

The Use of Assertions in Algorithmic DebuggingWlodzimierz Drabent, Simin Nadjm-Tehrani, Jan Maluszynski. fgcs 1988: 573-581

1987

Inductive Assertion Method for Logic ProgramsWlodzimierz Drabent, Jan Maluszynski. tapsoft 1987: 167-181

Do Logic Programs Resemble Programs in Conventional Languages?Wlodzimierz Drabent. SLP 1987: 289-396

1986

Proving Properties of Pascal Programs in MIZAR 2Piotr Rudnicki, Wlodzimierz Drabent. ACTA, 22(6):699-707, 1986.

1985

Proving Properties of Pascal Programs in MIZAR 2Piotr Rudnicki, Wlodzimierz Drabent. ACTA, 22(3):311-331, 1985.

Sign in or sign up to see more results.

runs on WebDSL