An algorithm for approximating the satisfiability problem of high-level conditions

DOI10.1016/J.ENTCS.2008.04.075MaRDI QIDQ5403460zbMATH OpenOpenAlexFDO

Authors Karl-Heinz Pennemann

Publication date 26 March 2014

Published in Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.entcs.2008.04.075

zbMATH Keywords

graph transformationhigh-level conditionsweak adhesive HLR categoriesfirst-order satisfiability problemhigh-level programs

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Specification and verification (program logics, model checking, etc.) (68Q60) Logic in computer science (03B70)

Recommendations

• Satisfiability of High-Level Conditions
• Resolution-Like Theorem Proving for High-Level Conditions
• scientific article; zbMATH DE number 4039349
• scientific article; zbMATH DE number 2157028
• Probabilistic performance of a heurisic for the satisfiability problem

Cites work

• scientific article; zbMATH DE number 1701353 (Why is no real title available?)
• scientific article; zbMATH DE number 1142315 (Why is no real title available?)
• A machine program for theorem-proving
• Adhesive high-level replacement systems: a new categorical framework for graph transformation
• Constructing finite algebras with FALCON
• Correctness of high-level transformation systems relative to nested conditions
• Fundamentals of algebraic graph transformation
• Graph Transformations
• Graph Transformations
• Satisfiability of High-Level Conditions
• The model evolution calculus.
• Theory of constraints and application conditions: from graphs to high-level structures
• Weakest Preconditions for High-Level Programs

Cited in

(7)

• Resolution-Like Theorem Proving for High-Level Conditions
• Theorem proving graph grammars with attributes and negative application conditions
• Correctness of high-level transformation systems relative to nested conditions
• Development of Correct Graph Transformation Systems
• An approximative inference method for solving ∃∀SO satisfiability problems
• Satisfiability of High-Level Conditions
• Comprehensive systems: a formal foundation for multi-model consistency management

Describes a project that uses

Uses Software

• FALCON
• Mace4
• MiniSat

This page was built for publication: An algorithm for approximating the satisfiability problem of high-level conditions

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