Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 3 of 3 for “"well-founded semantics"”.
-
Flexible Computation of the Well-Founded Semantics of Normal Logic Programs
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 …
-
Possible worlds explorer: Combining declarative programming with user-friendly Jupyter Notebooks
… PWE also has support for the three-valued well-founded semantics of Datalog programs (via DLV) and temporal models that use a special state argument. Using simple Python functions, generic as well as user-definable presentation and visualization formats can be easily created, e.g., to …
-
Negation in logic and deductive databases
… For the logic CF 0 , the usual Kripke formal semantics is defined but based on situations instead of conventional possible worlds. A sound and complete axiomatic system of CF 0 is established based on the axiomatic systems of constructive logics with strong negation and Thomason's completeness …