Synthesis of proof procedures for default reasoning

Dung, PM; Kowalski, RA; Toni, F

dc.contributor.author	Dung, PM	en
dc.contributor.author	Kowalski, RA	en
dc.contributor.author	Toni, F	en
dc.date.accessioned	2014-03-01T01:46:36Z
dc.date.available	2014-03-01T01:46:36Z
dc.date.issued	1997	en
dc.identifier.issn	0302-9743	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/24944
dc.subject.classification	Computer Science, Theory & Methods	en
dc.subject.other	LOGIC	en
dc.title	Synthesis of proof procedures for default reasoning	en
heal.type	journalArticle	en
heal.language	English	en
heal.publicationDate	1997	en
heal.abstract	We apply logic program development technology to define abstract proof procedures, in the form of logic programs, for computing the admissibility semantics for default reasoning proposed in [2]. The proof procedures are derived from a formal specification. The derivation guarantees the soundness of the proof procedures. The completeness of the proof procedures is shown by employing a technique of symbolic execution of logic programs to compute (an instance of) a relation implied by the specification.	en
heal.publisher	SPRINGER-VERLAG BERLIN	en
heal.journalName	LOGIC PROGRAM SYNTHESIS AND TRANSFORMATION	en
heal.bookName	LECTURE NOTES IN COMPUTER SCIENCE	en
dc.identifier.isi	ISI:A1997BJ62V00018	en
dc.identifier.volume	1207	en
dc.identifier.spage	313	en
dc.identifier.epage	324	en