2000
DOI: 10.1007/3-540-44533-1_82
|View full text |Cite
|
Sign up to set email alerts
|

Minimal Model Generation with Factorization and Constrained Search

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
5
0

Year Published

2017
2017
2017
2017

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(5 citation statements)
references
References 2 publications
0
5
0
Order By: Relevance
“…Algorithms for computing minimal and maximal models have been studied in the past (e.g. [7,78,8,45,51]). In some contexts, minimal and maximal models have been referred to as MIN-ONE ⊆ and MAX-ONE ⊆ solutions (e.g.…”
Section: Minimal and Maximal Modelsmentioning
confidence: 99%
“…Algorithms for computing minimal and maximal models have been studied in the past (e.g. [7,78,8,45,51]). In some contexts, minimal and maximal models have been referred to as MIN-ONE ⊆ and MAX-ONE ⊆ solutions (e.g.…”
Section: Minimal and Maximal Modelsmentioning
confidence: 99%
“…In this manner, we can compare two models by set inclusion. We here give the following two definitions [8]: Definition 1. Let V p , V 1 and V 2 be sets of propositional variables.…”
Section: Propositional Formulas and Minimal Model Generationmentioning
confidence: 99%
“…Niemelä reported a method to find the minimal models for propositional logic with ECLiPSe Prolog [10]. Koshimura et al also reported a minimal model generator based on SAT solvers [8] which we use in this paper. They provided the following theorem [10,8]: …”
Section: Propositional Formulas and Minimal Model Generationmentioning
confidence: 99%
See 2 more Smart Citations