{"id":{"repo_id":"passau-thes","oai_identifier":"oai:kobv.de-opus4-uni-passau:19"},"canonical_url":"https://search.dev.ndltd.org/etd/passau-thes/oai:kobv.de-opus4-uni-passau:19","repository":{"repo_id":"passau-thes","name":"Universität Passau","base_url":"https://opus4.kobv.de/opus4-uni-passau/oai"},"display":{"title":"Flexible Computation of the Well-Founded Semantics of Normal Logic Programs","abstract":"The well-founded semantics has been accepted as the most relevant semantics for logic-based information systems. In this dissertation a framework based on a set of program transformations is presented that generalizes all major computation approaches for the well-founded semantics using a common data structure and provides a common language to describe their evaluation strategy. This rewriting system gives the formal background to analyze and combine different evaluation strategies in a common framework, or to design new algorithms and prove the correctness of its implementations at a high level just by changing the order of program transformations.","abstract_html":"The well-founded semantics has been accepted as the most relevant semantics for logic-based information systems. In this dissertation a framework based on a set of program transformations is presented that generalizes all major computation approaches for the well-founded semantics using a common data structure and provides a common language to describe their evaluation strategy. This rewriting system gives the formal background to analyze and combine different evaluation strategies in a common framework, or to design new algorithms and prove the correctness of its implementations at a high level just by changing the order of program transformations.","abstract_has_math":false,"creators":["Zukowski, Ulrich"],"institution":"Universität Passau","degree_name":null,"degree_level":"thesis.doctoral","degree_discipline":null,"degree_department":null,"school":null,"contributors":["Brandenburg, Franz-Josef"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2001,"date_issued":"2001-07-24","date_published":"2001-07-24","updated_at":"2026-07-24T03:44:57Z","subjects":["Wohlfundierte Semantik","Logische Programme","Programmtransformation","Auswertungsstrategien","well-founded semantics","program transformations"],"languages":[],"rights":["Standardbedingung laut Einverständniserklärung"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://opus4.kobv.de/opus4-uni-passau/frontdoor/index/index/docId/19","outbound_label":"Repository record","outbound_source":"source_url"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Brandenburg, Franz-Josef"]},{"key":"dc:creator","label":"Author","values":["Zukowski, Ulrich"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:publisher","label":"Institution","values":["Universität Passau"]},{"key":"dc:type","label":"Dc Type","values":["doctoralThesis"]},{"key":"thesis:degree_level","label":"Degree Level","values":["thesis.doctoral"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["Universität Passau"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Wohlfundierte Semantik","Logische Programme","Programmtransformation","Auswertungsstrategien","well-founded semantics","program transformations"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:rights","label":"Dc Rights","values":["Standardbedingung laut Einverständniserklärung"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["The well-founded semantics has been accepted as the most relevant semantics for logic-based information systems. In this dissertation a framework based on a set of program transformations is presented that generalizes all major computation approaches for the well-founded semantics using a common data structure and provides a common language to describe their evaluation strategy. This rewriting system gives the formal background to analyze and combine different evaluation strategies in a common framework, or to design new algorithms and prove the correctness of its implementations at a high level just by changing the order of program transformations.","Die wohlfundierte Semantik hat sich als eine der wichtigsten Semantiken für logische Regelsprachen herausgestellt. In dieser Dissertation wird ein Framework vorgestellt, das, basierend auf Programmtransformationen, eine einheitliche Datenstruktur und eine einheitliche Sprache zur Beschreibung von Auswertungsstrategien definiert und dadurch alle wichtigen Auswertungsverfahren für die wohlfundierte Semantik verallgemeinert. Das in dieser Dissertation vorgestellte Transformationssystem liefert die formalen Mittel, um unterschiedliche Auswertungsstrategien für die wohlfundierte Semantik analysieren und kombinieren zu können, oder um neue Algorithmen auf einem hohen Abstraktionsniveau durch Angabe regulärer Ausdrücke zu spezifizieren und deren Korrektheit beweisen zu können."]},{"key":"dc:format.medium","label":"Dc Format Medium","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Flexible Computation of the Well-Founded Semantics of Normal Logic Programs"]}]}],"canonical_facts":{"dc:contributor":["Brandenburg, Franz-Josef"],"dc:creator":["Zukowski, Ulrich"],"dc:description.abstract":["The well-founded semantics has been accepted as the most relevant semantics for logic-based information systems. In this dissertation a framework based on a set of program transformations is presented that generalizes all major computation approaches for the well-founded semantics using a common data structure and provides a common language to describe their evaluation strategy. This rewriting system gives the formal background to analyze and combine different evaluation strategies in a common framework, or to design new algorithms and prove the correctness of its implementations at a high level just by changing the order of program transformations.","Die wohlfundierte Semantik hat sich als eine der wichtigsten Semantiken für logische Regelsprachen herausgestellt. In dieser Dissertation wird ein Framework vorgestellt, das, basierend auf Programmtransformationen, eine einheitliche Datenstruktur und eine einheitliche Sprache zur Beschreibung von Auswertungsstrategien definiert und dadurch alle wichtigen Auswertungsverfahren für die wohlfundierte Semantik verallgemeinert. Das in dieser Dissertation vorgestellte Transformationssystem liefert die formalen Mittel, um unterschiedliche Auswertungsstrategien für die wohlfundierte Semantik analysieren und kombinieren zu können, oder um neue Algorithmen auf einem hohen Abstraktionsniveau durch Angabe regulärer Ausdrücke zu spezifizieren und deren Korrektheit beweisen zu können."],"dc:format.medium":["application/pdf"],"dc:publisher":["Universität Passau"],"dc:rights":["Standardbedingung laut Einverständniserklärung"],"dc:subject":["Wohlfundierte Semantik","Logische Programme","Programmtransformation","Auswertungsstrategien","well-founded semantics","program transformations"],"dc:title":["Flexible Computation of the Well-Founded Semantics of Normal Logic Programs"],"dc:type":["doctoralThesis"],"thesis:degree_level":["thesis.doctoral"],"thesis:institution_name":["Universität Passau"]},"updated_at":"2026-07-24T03:44:57Z"}