The Well-founded Semantics Is the Principle of Inductive Definition

The Well-founded Semantics Is the Principle of Inductive Definition (1998)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Marc Denecker

Venue:	Logics in Arti Intelligence
Citations:	38 - 23 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	The Well-founded Semantics Is the Principle of Inductive Definition	user correction - Legacy Corrections
AUTHOR NAME	Marc Denecker	SVM HeaderParse 0.1
AUTHOR AFFIL	Department of Computer Science, K.U.Leuven,	SVM HeaderParse 0.2
AUTHOR ADDR	Celestijnenlaan 200A, B-3001 Heverlee, Belgium.	SVM HeaderParse 0.1
ABSTRACT	. Existing formalisations of (transfinite) inductive definitions in constructive mathematics are reviewed and strong correspondences with LP under least model and perfect model semantics become apparent. I point to fundamental restrictions of these existing formalisations and argue that the well-founded semantics (wfs) overcomes these problems and hence, provides a superior formalisation of the principle of inductive definition. The contribution of this study for LP is that it (re- )introduces the knowledge theoretic interpretation of LP as a logic for representing definitional knowledge. I point to fundamental differences between this knowledge theoretic interpretation of LP and the more commonly known interpretations of LP as default theories or auto-epistemic theories. The relevance is that differences in knowledge theoretic interpretation have strong impact on knowledge representation methodology and on extensions of the LP formalism, for example for representing uncertainty. Keywo...	user correction - Legacy Corrections
YEAR	1998	INFERENCE
VENUE	Logics in Arti Intelligence	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	1--16	INFERENCE
VOLUME	1489	INFERENCE
CITATIONS	3 found	ParsCit 1.0