Computational Issues in Calculi of Partial Inductive Definitions
Number of Authors: 1
1995 (English)Doctoral thesis, monograph (Other academic)
We study the properties of a number of algorithms proposed to explore the computational space generated by a very simple and general idea: the notion of a mathematical definition and a number of suggested formal interpretations ofthis idea. Theories of partial inductive definitions (PID) constitute a class of logics based on the notion of an inductive definition. Formal systems based on this notion can be used to generalize Horn-logic and naturally allow and suggest extensions which differ in interesting ways from generalizations based on first order predicate calculus. E.g. the notion of completion generated by a calculus of PID and the resulting notion of negation is completely natural and does not require externally motivated procedures such as "negation as failure". For this reason, computational issues arising in these calculi deserve closer inspection. This work discuss a number of finitary theories of PID and analyzethe algorithmic and semantical issues that arise in each of them. There has been significant work on implementing logic programming languages in this setting and we briefly present the programming language and knowledge modelling tool GCLA II in which many of the computational prob-lems discussed arise naturally in practice.
Place, publisher, year, edition, pages
1995, 1. , 218 p.
Theory of computation, algorithms, logic, proof-theory, partial inductive defi-nitions, definitional reflection, disunification, closure, completion, negation, constructive negation, quantification, logic programming, meta programming, quantification, skolemization, self-reference, program semantics, declarative control, proof-search, theorem-proving.
Computer and Information Science
IdentifiersURN: urn:nbn:se:ri:diva-21196OAI: oai:DiVA.org:ri-21196DiVA: diva2:1041230
Also published as SICS Dissertation no. SICS-D-192016-10-312016-10-31