Incremental reasoning on monadic second-order logics with logic programming

DOI10.1016/j.jlamp.2015.11.002zbMath1351.68056MaRDI QIDQ5963088

Gulay Unel

Publication date: 4 March 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.2015.11.002

zbMATH Keywords

monadic second-order logic; data stream; incremental reasoning

Mathematics Subject Classification ID

68T27: Logic in artificial intelligence

03B70: Logic in computer science

68N17: Logic programming

Uses Software

• MONA
• LTL2BA
• XSB

Cites Work

• Incremental classification of description logics ontologies
• A logic for default reasoning
• Reasoning about infinite computations
• On the logic of iterated belief revision
• Stream data management.
• XSB: Extending Prolog with Tabled Logic Programming
• On the power of magic
• Set constructors in a logic database language
• Weak Second‐Order Arithmetic and Finite Automata
• Propositional Dynamic Logic as a Logic of Belief Revision
• Logic Programming Approach to Automata-Based Decision Procedures
• Deciding full branching time logic
• Decision Problems of Finite Automata Design and Related Arithmetics
• Inductive Logic Programming: Theory and methods
• Alternating automata: Unifying truth and validity checking for temporal logics
• An automata-theoretic approach to branching-time model checking
• Generalized finite automata theory with an application to a decision problem of second-order logic
• Testing and generating infinite sequences by a finite automaton
• Decidability of Second-Order Theories and Automata on Infinite Trees
• On model checking for the \(\mu\)-calculus and its fragments
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item