Algorithmic Debugging and Hypothetical Reasoning

Authors:
Clemens Beckstein;Gerhard Tobermann
Affiliations:
Friedrich-Schiller-Universität Jena, Fakultät für Mathematik und Informatik, Institut für Informatik, D-07740 Jena, Germany E-mail: beckstein@informatik.uni-jena.de;Consulting für Office und Information Management GmbH, Industriestraße 1-3, D-91074 Herzogenaurach, Germany E-mail: tobergrh@coi.ina.de
Venue:
Automated Software Engineering
Year:
1997

Citing 13
Cited 1

An assumption-based TMS

Artificial Intelligence
Negation as inconsistency .I

Journal of Logic Programming
Rational debugging in logic programming

Proceedings on Third international conference on logic programming
Error diagnosis in logic programming, an adaptation of E.Y. Shapiro's method

Journal of Logic Programming
Foundations of logic programming; (2nd extended ed.)

Foundations of logic programming; (2nd extended ed.)
Clausal intuitionistic logic I. Fixed-point semantics

Journal of Logic Programming
Clausal intuitionistic logic II. Tableau proof procedures

Journal of Logic Programming
Logic programming: systematic program development

Logic programming: systematic program development
Analysis of meta-programs

Meta-programming in logic programming
Elements of algorithmic proof

Handbook of logic in computer science (vol. 2)
A Pragmatic Survey of Automated Debugging

AADEBUG '93 Proceedings of the First International Workshop on Automated and Algorithmic Debugging
What's in a Trace: The Box Model Revisited

AADEBUG '93 Proceedings of the First International Workshop on Automated and Algorithmic Debugging
Algorithmic program debugging

Algorithmic program debugging

Reasoning about nonlinear system identification

Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a generalization of Shapiro style algorithmic debugging for generalized Horn clause intuitionistic logic. This logic offers hypothetical reasoning and negation is defined not by failure but by inconsistency. We extend Shapiro‘s notion of intended interpretation, symptoms and errors and give formal results paralleling those known for definite clauses. We also show how a corresponding diagnosis module for {\sc Risc}—a logic programming system for generalized Horn clause intuitionistic logic—can be defined by meta interpretation. In contrast to Shapiro‘s {\sc Prolog} modules ours work independently of the specific computation rule that in {\sc Risc} may be specified by the user.