Counterexample Guided Abstraction Refinement Algorithm for Propositional Circumscription-Reference-Cited by-同舟云学术

Counterexample Guided Abstraction Refinement Algorithm for Propositional Circumscription

Published:2010 Issue: Volume: Page:195-207
ISSN:0302-9743
Container-title:Logics in Artificial Intelligence
language:
Short-container-title:

Author:

Janota Mikoláš,Grigore Radu,Marques-Silva Joao

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-15675-5_18

Reference25 articles.

1. Cadoli, M., Lenzerini, M.: The complexity of closed world reasoning and circumscription. In: AAAI Conference on Artificial Intelligence, pp. 550–555 (1990)

2. Castell, T., Cayrol, C., Cayrol, M., Berre, D.L.: Using the Davis and Putnam procedure for an efficient computation of preferred models. In: European Conference on Artificial Intelligence, pp. 350–354 (1996)

3. Lecture Notes in Computer Science;E.M. Clarke,2000

4. Dix, J., Furbach, U., Niemelä, I.: Nonmonotonic reasoning: Towards efficient calculi and implementations. In: Voronkov, A., Robinson, A. (eds.) Handbook of Automated Reasoning, vol. 19, pp. 1241–1354. North-Holland, Amsterdam (2001)

5. Egly, U., Eiter, T., Tompits, H., Woltran, S.: Solving advanced reasoning tasks using quantified boolean formulas. In: AAAI Conference on Artificial Intelligence, pp. 417–422 (2000)

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

1. Computing MUS-Based Inconsistency Measures;Logics in Artificial Intelligence;2023

2. Strong Refinements for Hard Problems in Argumentation Dynamics;FRONT ARTIF INTEL AP;2020

3. Complexity Results and Algorithms for Extension Enforcement in Abstract Argumentation;Journal of Artificial Intelligence Research;2017-09-13

4. Solving QBF with counterexample guided refinement;Artificial Intelligence;2016-05

5. Synchronous counting and computational algorithm design;Journal of Computer and System Sciences;2016-03