Browsing by Subject "Computer circuits"

Sort by: Order: Results:

Now showing items 1-2 of 2
  • Hella, Lauri; Kuusisto, Antti; Meier, Arne; Virtema, J. (Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017)
    Leibniz International Proceedings in Informatics
    Propositional and modal inclusion logic are formalisms that belong to the family of logics based on team semantics. This article investigates the model checking and validity problems of these logics. We identify complexity bounds for both problems, covering both lax and strict team semantics. By doing so, we come close to finalising the programme that ultimately aims to classify the complexities of the basic reasoning problems for modal and propositional dependence, independence, and inclusion logics.
  • Dalmonte, Tiziano; Negri, S.; Olivetti, Nicola; Pozzato, Gian Luca (2020)
    In this work we briefly summarize our recent contributions in the field of proof methods, theorem proving and countermodel generation for non-normal modal logics. We first recall some labelled sequent calculi for the basic system E and its extensions with axioms M, N, and C based on bi-neighbourhood semantics. Then, we present PRONOM, a theorem prover and countermodel generator for non-normal modal logics implemented in Prolog. When a modal formula is valid, then PRONOM computes a proof in the labelled calculi, otherwise it is able to extract a model falsifying it from an open, saturated branch. © 2020 for this paper by its authors. Use permitted under Creative Commons License Attribution 4.0 International (CC BY 4.0).