Maximal falsifiability-Reference-Cited by-同舟云学术

Maximal falsifiability

Published:2016-03-02 Issue:2 Volume:29 Page:351-370
ISSN:1875-8452
Container-title:AI Communications
language:
Short-container-title:AIC

Author:

Ignatiev Alexey¹,Morgado Antonio¹,Planes Jordi²,Marques-Silva Joao¹³

Affiliation:

1. INESC-ID, IST, University of Lisbon, Lisbon, Portugal. E-mails: aign@sat.inesc-id.pt, ajrm@sat.inesc-id.pt

2. Universitat de Lleida, Lleida, Spain. E-mail: jplanes@diei.udl.cat

3. UCD CASL, Dublin, Ireland. E-mail: jpms@ucd.ie

Publisher

IOS Press

Subject

Artificial Intelligence

Reference76 articles.

1. The enumeration of maximal cliques of large graphs;Akkoyunlu;SIAM J. Comput.,1973

2. Fast local search for the maximum independent set problem;Andrade;J. Heuristics,2012

3. On the minimum hitting set of bundles problem;Angel;Theor. Comput. Sci.,2009

4. [4]C. Ansótegui, M.L. Bonet and J. Levy, A new algorithm for weighted partial MaxSAT, in: AAAI Conference on Artificial Intelligence, 2010.

5. [5]C. Ansotegui, C.M. Li, F. Manya and Z. Zhu, A SAT-based approach to MinSAT, in: International Conference of the Catalan Association for Artificial Intelligence, 2012, pp. 185–189.

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Chapter 23. MaxSAT, Hard and Soft Constraints;Frontiers in Artificial Intelligence and Applications;2021-02-02

2. Chapter 4. Conflict-Driven Clause Learning SAT Solvers;Frontiers in Artificial Intelligence and Applications;2021-02-02

3. A resolution calculus for MinSAT;Logic Journal of the IGPL;2019-10-23

4. Clause tableaux for maximum and minimum satisfiability;Logic Journal of the IGPL;2019-08-27

5. A Clause Tableau Calculus for MinSAT;FRONT ARTIF INTEL AP;2016