Enhancing unsatisfiable cores for LTL with information on temporal relevance (Q507378): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4992524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a notion of unsatisfiable and unrealizable cores for LTL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locating Minimal Infeasible Constraint Sets in Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Small Unsatisfiable Cores in Satisfiability Modulo Theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385542 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient detection of vacuity in temporal model checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sanity Checks in Formal Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symbolic Implementation of Alternating Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Aided Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tools and Algorithms for the Construction and Analysis of Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explaining Counterexamples Using Causality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tools and Algorithms for the Construction and Analysis of Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extracting unsatisfiable cores for LTL via temporal resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Temporal logic can be more expressive / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clausal temporal resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Temporal resolution using a breadth-first search algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4012170 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4804909 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boolean Abstraction for Temporal Logic Satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of diagnosis from first principles / rank
 
Normal rank
Property / cites work
 
Property / cites work: A correction to the algorithm in Reiter's theory of diagnosis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vacuity Checking in the Modal Mu-Calculus* / rank
 
Normal rank
Property / cites work
 
Property / cites work: Results on the propositional \(\mu\)-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2760241 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Description Logic Handbook / rank
 
Normal rank
Property / cites work
 
Property / cites work: MUST: Provide a Finer-Grained Explanation of Unsatisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Principles of Constraint Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2724150 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3490999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstructing proofs at the assertion level / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952309 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enhancing unsatisfiable cores for LTL with information on temporal relevance / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Context-Free Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5678435 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of propositional linear temporal logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: The propositional dynamic logic of deterministic, well-structured programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complementation problem for Büchi automata with applications to temporal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: A structure-preserving clause form translation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symbolic model checking: \(10^{20}\) states and beyond / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Machine-Oriented Logic Based on the Resolution Principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2751353 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A clausal resolution method for CTL branching-time temporal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Search strategies for resolution in temporal logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chrobak Normal Form Revisited, with Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Construction of Semilinear Representations of Languages Accepted by Unary Nondeterministic Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Antichains: Alternative Algorithms for LTL Satisfiability and Model-Checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deductive verification of simple foraging robotic behaviours / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5503674 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4941841 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fully automatic theorem prover with human-style output / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4583686 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for computing minimal unsatisfiable subsets of constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Categorisation of Clauses in Conjunctive Normal Forms: Minimally Unsatisfiable Sub-clause-sets and the Lean Kernel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended Resolution Proofs for Conjoining BDDs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended Resolution Proofs for Symbolic SAT Solving with Quantification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tools and algorithms for the construction and analysis of systems. 10th international conference, TACAS 2004, held as part of the joint conferences on theory and practice of software, ETAPS 2004, Barcelona, Spain, March 29 -- April 2, 2004. Proceedings. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and applications of satisfiability testing -- SAT 2006. 9th international conference, Seattle, WA, USA, August 12--15, 2006. Proceedings. / rank
 
Normal rank

Revision as of 08:54, 13 July 2024

scientific article
Language Label Description Also known as
English
Enhancing unsatisfiable cores for LTL with information on temporal relevance
scientific article

    Statements

    Enhancing unsatisfiable cores for LTL with information on temporal relevance (English)
    0 references
    0 references
    6 February 2017
    0 references
    LTL
    0 references
    unsatisfiable cores
    0 references
    vacuity
    0 references
    temporal resolution
    0 references
    resolution graphs
    0 references
    Parikh images
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers