Rule-based Calculi for Extensions of Logic Programming
نویسنده
چکیده
The focus of this paper lies on the proof-theory for extensions of Logic Programming in which it is possible to draw negative conclusions both in a direct (i.e., based on a proof) and in an indirect (i.e., based on the lack of a proof) way. These extensions are provided with a rule-based deductive system in the sense of the work of Jager [8] for Normal Logic Programs. Rule-based deductive systems can be used as a powerful tool to study the structural properties of the logic programming languages. Furthermore, in the deductive systems the fundamental semantical properties of the languages can be formalised by proof-rules of the systems. Therefore, di erent extensions of logic programming can be compared by comparing their deductive systems.
منابع مشابه
Equality propositional logic and its extensions
We introduce a new formal logic, called equality propositional logic. It has two basic connectives, $boldsymbol{wedge}$ (conjunction) and $equiv$ (equivalence). Moreover, the $Rightarrow$ (implication) connective can be derived as $ARightarrow B:=(Aboldsymbol{wedge}B)equiv A$. We formulate the equality propositional logic and demonstrate that the resulting logic has reasonable properties such a...
متن کاملStructural Extensions of Display Calculi: A General Recipe
We present a systematic procedure for constructing cut-free display calculi for axiomatic extensions of a logic via structural rule extensions. The sufficient conditions for the procedure are given in terms of (purely syntactic) abstract properties of the display calculus and thus the method applies to large classes of calculi and logics. As a case study, we present cut-free calculi for extensi...
متن کاملA rule-based evaluation of ladder logic diagram and timed petri nets for programmable logic controllers
This paper describes an evaluation through a case study by measuring a rule-based approach, which proposed for ladder logic diagrams and Petri nets. In the beginning, programmable logic controllers were widely designed by ladder logic diagrams. When complexity and functionality of manufacturing systems increases, developing their software is becoming more difficult. Thus, Petri nets as a high l...
متن کاملA Unified Approach to Theory Reasoning
Theory reasoning is a kind of two-level reasoning in automated theorem proving, where the knowledge of a given domain or theory is separated and treated by special purpose inference rules. We define a classification for the various approaches for theory reasoning which is based on the syntactic concepts of literal level — term level — variable level. The main part is a review of theory extensio...
متن کاملReliability Measures Measurement under Rule-Based Fuzzy Logic Technique
In reliability theory, the reliability measures contend the very important and depreciative role for any system analysis. Measurement of reliability measures is not easy due to ambiguity and vagueness which exist within reliability parameters. It is also very difficult to incorporate a large amount of uncertainty in well-established methodologies and techniques. However, fuzzy logic provides an...
متن کامل