Efficient minimal model generation using branching lemmas

DOI10.1007/10721959_15MaRDI QIDQ2723419zbMATH OpenFDO

Authors Ryuzo Hasegawa, Hiroshi Fujita, Miyuki Koshimura

Publication date 5 July 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/10721959_15

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Reasoning with minimal models: efficient algorithms and applications
• An incremental algorithm for generating all minimal models
• Computing minimal models by partial instantiation
• scientific article; zbMATH DE number 812581
• scientific article; zbMATH DE number 1884382
• Minimisation of models satisfying CTL formulas
• Computing minimal models, stable models and answer sets
• Computing minimal models modulo subset-simulation for modal logics
• On computing minimal models

Cited in

(9)

• Paracoherent answer set computation
• Computational Space Efficiency and Minimal Model Generation for Guarded Formulae
• Terminating minimal model generation procedures for propositional modal logics
• scientific article; zbMATH DE number 177241 (Why is no real title available?)
• Minimal model generation
• Generating minimal Herbrand models step by step
• Cautious reasoning in ASP via minimal models and unsatisfiable cores
• First-order resolution methods for modal logics
• ASP and subset minimality: enumeration, cautious reasoning and MUSes

Describes a project that uses

Uses Software

• TPTP

This page was built for publication: Efficient minimal model generation using branching lemmas

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