Derivatives of Logical Formulas
نویسنده
چکیده
We formalize new decision procedures for WS1S, M2L(Str), and Presburger Arithmetics. Formulas of these logics denote regular languages. Unlike traditional decision procedures, we do not translate formulas into automata (nor into regular expressions), at least not explicitly. Instead we devise notions of derivatives (inspired by Brzozowski derivatives for regular expressions) that operate on formulas directly and compute a syntactic bisimulation using these derivatives. The treatment of Boolean connectives and quantifiers is uniform for all mentioned logics and is abstracted into a locale. This locale is then instantiated by different atomic formulas and their derivatives (which may differ even for the same logic under different encodings of interpretations as formal words). The WS1S instance is described in the draft paper A Coalgebraic Decision Procedure for WS1S 1 by the author.
منابع مشابه
Formalizing Symbolic Decision Procedures for Regular Languages
This thesis studies decision procedures for the equivalence of regular languages represented symbolically as regular expressions or logical formulas. Traditional decision procedures in this context rush to dispose of the concise symbolic representation by translating it into finite automata, which then are efficiently minimized and checked for structural equality. We develop procedures that avo...
متن کاملReasoning with Semantic Tableau Binary Trees in Description Logic
Authors of the Handbook of Description Logic present tableaux algorithms by means of a collection of so-called completion rules intended to generate a completion of ABox with respect to a corresponding TBox of a knowledge base S. An approach we present here is slightly modified. We use a set S of DL formulas of a knowledge base Σ containing DL formulas of ABox and transcriptions of definitions ...
متن کاملA Resolution Calculus for Modal Logics
In this paper, we present a resolution calculus for the first-order modal logic S4. The formulas are given not necessary in a clausal form. This method can be used for automatizable proof procedure of a quantified modal logic. We will consider formulas for which the following conditions hold: 1. the formulas F contain only logical connectives ¬,&,∨, and no logical or modal symbol in F lies in t...
متن کاملConstructing Knowledge Representation Systems with First-Order Formulas as Atoms
This paper proposes a knowledge representation system by extension of the concept of atom. Not only conventional simple atoms, but also atoms representing first-order formulas, which are called formula atoms, are used. By this extension, predicates, logical connectives, and quantifiers may occur in atoms, and can be regarded as objects in the same class, allowing more natural translation from n...
متن کاملAlgorithms for Learning Logical Formulas
We present here a learning technique which is both s ta t i s t i c and syntactic, by using simultaneously logical operators and counting procedures. I ts modular structure makes it usable for creating the necessary redundancy for control l ing the generalization of the formulas.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Archive of Formal Proofs
دوره 2015 شماره
صفحات -
تاریخ انتشار 2015