Computation theory and logic
Every logic program has a natural stratification and an iterated least fixed point model
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The well-founded semantics for general logic programs
Journal of the ACM (JACM)
The Semantics of Predicate Logic as a Programming Language
Journal of the ACM (JACM)
Complexity and expressive power of logic programming
ACM Computing Surveys (CSUR)
Towards a Precise Definition of the OMG/MDA Framework
Proceedings of the 16th IEEE international conference on Automated software engineering
Actor-oriented models for codesign: balancing re-use and performance
Formal methods and models for system design
Towards a formal foundation for domain specific modeling languages
EMSOFT '06 Proceedings of the 6th ACM & IEEE International conference on Embedded software
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
DKAL and Z3: a logic embedding experiment
Fields of logic and computation
Formalizing a domain specific language using SOS: an industrial case study
SLE'11 Proceedings of the 4th international conference on Software Language Engineering
Beyond first-order satisfaction: fixed points, interpolants, automata and polynomials
SPIN'12 Proceedings of the 19th international conference on Model Checking Software
Hi-index | 0.00 |
Model generation is an important formal technique for finding interesting instances of computationally hard problems. In this paper we study model generation over Horn logic under the closed world assumption extended with stratified negation. We provide a novel three-stage algorithm that solves this problem: First, we reduce the relevant Horn clauses to a set of non-monotonic predicates. Second, we apply a fixed-point procedure to these predicates that reveals candidate solutions to the model generation problem. Third, we encode these candidates into a satisfiability problem that is evaluated with a state-of-the-art SMT solver. Our algorithm is implemented, and has been successfully applied to key problems arising in model-based design.