A Deductive System for Existential Least Fixpoint Logic
نویسندگان
چکیده
منابع مشابه
A Deductive System for FO(ID) Based on Least Fixpoint Logic
The logic FO(ID) uses ideas from the field of logic programming to extend first order logic with non-monotone inductive definitions. The goal of this paper is to extend Gentzen’s sequent calculus to obtain a deductive inference method for FO(ID). The main difficulty in building such a proof system is the representation and inference of unfounded sets. It turns out that we can represent unfounde...
متن کاملStratified Least Fixpoint Logic
Compton, K.J., Stratified least fixpoint logic, Theoretical Computer Science 131 (1994) 95-120. Stratified least jixpoint logic, or SLFP, characterizes the expressibility of stratified logic programs and, in a different formulation, has been used as a logic of imperative programs. These two formulations of SLFP are proved to be equivalent. A complete sequent calculus with one infinitary rule is...
متن کاملMixed Fixpoint Theory for Disjunktive Deductive Databases
This paper deals with state generation and model generation for minimal model reasoning. We review the xpoint theory of two immediate consequence operators for databases, cf. also LoMiRa 92] and Fe 93], and prove some useful connections between them. For positive-disjunctive databases D, the rst operator T s D is based on hyperresolution. It operates on disjunctice Herbrand states and its least...
متن کاملEvidence for Fixpoint Logic
For many modal logics, dedicated model checkers offer diagnostics (e.g., counterexamples) that help the user understand the result provided by the solver. Fixpoint logic offers a unifying framework in which such problems can be expressed and solved, but a drawback of this framework is that it lacks comprehensive diagnostics generation. We extend the framework with a notion of evidence, which ca...
متن کاملFixpoint semantics for logic programming a survey
The variety of semantical approaches that have been invented for logic programs is quite broad, drawing on classical and many-valued logic, lattice theory, game theory, and topology. One source of this richness is the inherent non-monotonicity of its negation, something that does not have close parallels with the machinery of other programming paradigms. Nonetheless, much of the work on logic p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Logic and Computation
سال: 1993
ISSN: 0955-792X,1465-363X
DOI: 10.1093/logcom/3.2.197