Attribute-grammar interpreter for inexact reasoning

Panayiotopoulos, T; Papakonstantinou, G; Sgouros, N

dc.contributor.author	Panayiotopoulos, T	en
dc.contributor.author	Papakonstantinou, G	en
dc.contributor.author	Sgouros, N	en
dc.date.accessioned	2014-03-01T01:07:48Z
dc.date.available	2014-03-01T01:07:48Z
dc.date.issued	1990	en
dc.identifier.issn	0950-5849	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/10185
dc.relation.uri	http://www.scopus.com/inward/record.url?eid=2-s2.0-0025441377&partnerID=40&md5=0d75face8708115ff1a0eb1d98eb0dd6	en
dc.subject	attribute grammars	en
dc.subject	inexact reasoning	en
dc.subject	software engineering	en
dc.subject	theorem proving	en
dc.subject	uncertainty	en
dc.subject.classification	Computer Science, Information Systems	en
dc.subject.classification	Computer Science, Software Engineering	en
dc.subject.other	Computer Operating Systems - Program Interpreters	en
dc.subject.other	Attribute-Grammars	en
dc.subject.other	Inexact Reasoning	en
dc.subject.other	Theorem Proving	en
dc.subject.other	Automata Theory	en
dc.title	Attribute-grammar interpreter for inexact reasoning	en
heal.type	journalArticle	en
heal.language	English	en
heal.publicationDate	1990	en
heal.abstract	An extended attribute-grammar (AG) interpreter is presented, which exhibits both inexact reasoning and full theorem-proving capabilities. Software engineering applications may be faced with the extra benefit of an inexact processing mechanism. The proposed tool allows the properties of AGs, full theorem-proving, and inexact representation and processing to be combined. The procedural and declarative characteristics may be expressed in the AGs' language, with additional calls to user-defined semantic functions, written in the host language. The inexact reasoning method proposed is wide enough to easily incorporate many inexact reasoning schemes. © 1990.	en
heal.publisher	BUTTERWORTH-HEINEMANN LTD	en
heal.journalName	Information and Software Technology	en
dc.identifier.isi	ISI:A1990DH33900004	en
dc.identifier.volume	32	en
dc.identifier.issue	5	en
dc.identifier.spage	347	en
dc.identifier.epage	356	en