Comparing a Pair-Wise Compatibility Heuristic and Relaxed Stratification: Some Preliminary Results

Authors:
Robert E. Mercer;Lionel Forget;Vincent Risch
Affiliations:
-;-;-
Venue:
ECSQARU '01 Proceedings of the 6th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Year:
2001

Citing 8
Cited 1

A graph-theoretic approach to default logic

Information and Computation
Default theories that always have extensions

Artificial Intelligence
Graph theoretical structures in logic programs and default theories

Theoretical Computer Science
Computing with default logic

Artificial Intelligence
Algorithm 457: finding all cliques of an undirected graph

Communications of the ACM
Introduction to Default Logic

Introduction to Default Logic
On kernels, defaults and even graphs

Annals of Mathematics and Artificial Intelligence
A Tableau-Based Theorem Prover for a Decidable Subset of Default Logic

Proceedings of the 10th International Conference on Automated Deduction

Answer Set Programming by Ant Colony Optimization

JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

An extension-building heuristic is developed and a preliminary investigation of its computational properties is given by comparing its run times to those of DeReS which uses relaxed stratification, another extension-building heuristic. Heuristics which can take advantage of the structural properties of a default theory may provide the information about the theory so that divide-and-conquer-like techniques may be applied on those problems which exhibit appropriate structural properties. Structural properties of a default theory are defined in terms of properties of graphs that represent important features of default theories. Unlike the syntax-dependent heuristics used in previous extension-building algorithms, the heuristic developed here is consistency-based.