Logic programming approach to automata-based decision procedures

DOI10.1016/J.JLAMP.2016.02.005zbMATH Open1353.68039OpenAlexW2334804121MaRDI QIDQ347398FDOQ347398

Authors: Gulay Unel, David Toman 

Publication date: 30 November 2016

Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jlamp.2016.02.005

Recommendations

• Logic Programming Approach to Automata-Based Decision Procedures
• Lazy automata techniques for WS1S
• scientific article; zbMATH DE number 1841832
• MONA IMPLEMENTATION SECRETS
• An Incremental Technique for Automata-Based Decision Procedures

zbMATH Keywords

automatacomplex-value Datalog \((\text{Datalog}^{\text{cv}})\)magic setsSLG-resolutionWS1SWS2S

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Logic programming (68N17) Decidability of theories and sets of sentences (03B25)

Cites Work

• MONA IMPLEMENTATION SECRETS
• Deciding entailments in inductive separation logic with tree automata
• Title not available (Why is that?)
• Title not available (Why is that?)
• Decidability of Second-Order Theories and Automata on Infinite Trees
• Automata, logics, and infinite games. A guide to current research
• Reasoning about infinite computations
• Weak Second‐Order Arithmetic and Finite Automata
• Decision Problems of Finite Automata Design and Related Arithmetics
• Generalized finite automata theory with an application to a decision problem of second-order logic
• On model checking for the \(\mu\)-calculus and its fragments
• Title not available (Why is that?)
• An automata-theoretic approach to branching-time model checking
• Title not available (Why is that?)
• Testing and generating infinite sequences by a finite automaton
• An automata theoretic decision procedure for the propositional mu- calculus
• Title not available (Why is that?)
• On the power of magic
• Set constructors in a logic database language
• Automata for the modal \(\mu \)-calculus and related results
• The Description Logic Handbook
• Logic Programming Approach to Automata-Based Decision Procedures
• BDD-based decision procedures for the modal logic K ★
• Deciding full branching time logic
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Alternating automata: Unifying truth and validity checking for temporal logics
• A decision procedure for \(\mathrm{CTL}^{*}\) based on tableaux and automata

Cited In (3)

• Automatic Synthesis of Decision Procedures: A Case Study of Ground and Linear Arithmetic
• Logic Programming Approach to Automata-Based Decision Procedures
• An Incremental Technique for Automata-Based Decision Procedures

Uses Software

• MONA
• LTL2BA
• XSB
• Slide
• MSO_Regex_Equivalence

This page was built for publication: Logic programming approach to automata-based decision procedures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q347398)