loading
Papers Papers/2022 Papers Papers/2022

Research.Publish.Connect.

Paper

Paper Unlock

Author: Yakoub Salhi

Affiliation: CRIL-CNRS, Université d’Artois, F-62307 Lens Cedex and France

Keyword(s): Minimal Models, SAT, Enumeration Problem, Computational Complexity.

Related Ontology Subjects/Areas/Topics: Artificial Intelligence ; Constraint Satisfaction ; Symbolic Systems

Abstract: In this work, we propose approaches for enumerating all the minimal models for two particular classes of CNF formulæ. The first class is that of PN formulæ which are defined as CNF formulæ where each clause is either positive or negative, whereas the second class is that of PH formulæ in which each clause is either positive or a Horn clause. We first provide an approach for enumerating all the minimal models in the case of PN formulæ that is based on the use of an algorithm for generating the minimal transversals of a hypergraph. We also propose a SAT-based encoding for solving the same problem. Then, we provide a characterization of the minimal models in the case of PH formulæ, which allows us to use our approaches in the case of PN formulæ for solving the problem of minimal model enumeration for PH formulæ. Finally, we describe an application in datamining of the problem of enumerating the minimal models in the case of PN formulæ.

CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 3.133.117.113

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Salhi, Y. (2019). On Enumerating All the Minimal Models for Particular CNF Formula Classes. In Proceedings of the 11th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART; ISBN 978-989-758-350-6; ISSN 2184-433X, SciTePress, pages 403-410. DOI: 10.5220/0007257104030410

@conference{icaart19,
author={Yakoub Salhi.},
title={On Enumerating All the Minimal Models for Particular CNF Formula Classes},
booktitle={Proceedings of the 11th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART},
year={2019},
pages={403-410},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0007257104030410},
isbn={978-989-758-350-6},
issn={2184-433X},
}

TY - CONF

JO - Proceedings of the 11th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART
TI - On Enumerating All the Minimal Models for Particular CNF Formula Classes
SN - 978-989-758-350-6
IS - 2184-433X
AU - Salhi, Y.
PY - 2019
SP - 403
EP - 410
DO - 10.5220/0007257104030410
PB - SciTePress

- Science and Technology Publications, Lda.
RESOURCES

Proceedings

Papers

Authors

Ontology

CONTACTS

Science and Technology Publications, Lda
Avenida de S. Francisco Xavier, Lote 7 Cv. C,
2900-616 Setúbal, Portugal.

Phone: +351 265 520 185 (National fixed network call)
Fax: +351 265 520 186
Email: info@scitepress.org

EXTERNAL LINKS

PRIMORIS

INSTICC

SCITEVENTS

CROSSREF

PROCEEDINGS SUBMITTED FOR INDEXATION BY:

dblp

Ei Compendex

SCOPUS

Semantic Scholar

Google Scholar

Microsoft Academic