Handling inconsistency efficiently in the incremental construction of stratified belief bases

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1638, Issue , 1999, Pages 168-178

  Grégoire, Eric ^a  

^a UNIVERSITÉ D'ARTOIS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

COMPUTATIONAL RESOURCES; HANDLING INCONSISTENCIES; INCONSISTENCY HANDLING; INCREMENTAL CONSTRUCTION; LEXICOGRAPHIC ORDERING; REAL-LIFE APPLICATIONS; REVISION ALGORITHMS; SOLUTION QUALITY;

ARTIFICIAL INTELLIGENCE;

EID: 84947910620     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48747-6_16     Document Type: Conference Paper

References (24)

1. Battiti, R. and Protasi, M. (1996), "Reactive search, a history-based heuristic for MAX-SAT", Technical Report, Dipartimento di Mathematica, University of Trento, Italy.
2. Benferhat, S., Cayrol, C, Dubois, D., Lang J. and Prade H. (1993), "Inconsistency management and prioritized syntax-based entailment", Proc. of IJCAI’93, pp. 640-645.
3. Benferhat, S., Dubois, D. and Prade H. (1995), "How to infer from inconsistent beliefs without revising", Proc. of IJCAI’95, pp. 1449-1455.
4. th; Int. Conf. on Art. Int. Methodology, Systems and Applications (AIMSA’98), F. Giunchiglia (ed.), Sozopol, Bulgaria, LNCS 1480, Springer, pp. 115-128.
5. Brewka, G. (1989), "Preferred subtheories: an extended logical framework for default reasoning", Proc. of UCAI’89, pp. 1043-1048.
6. Brisoux, L., Saïs, L. and Grégoire, E. (1998), "Validation of knowledge-based systems by means of stochastic search", In: Proc. DEXA workshop on verification, validation and integrity issues in expert and databases systems, R.R. Wagner (ed.), Vienna, IEEE Computer Press, pp. 41-46.
7. Cayrol, C. and Lagasquie-schiex M.-C. (1994), "Comparaison d’inférence non monotone: étude de complexité", Rapport IRIT/93.23.R (second version of May 1994).
8. Davis, M., Logemann, G. and Loveland D. (1962), "A Machine Program for Theorem Proving", JACM, 5, pp. 394-397.
9. DIMACS (1993), Second Challenge on Satisfiability Testing organized by the Center for Discrete Mathematics and Computer Science of Rutgers University. Benchmarks avaible from http://dimacs.mtgers.edu/Challenges/index.html
10. Eiter, T. and Gottlob G, (1992), "On the complexity of propositional knowledge base revision, updates and counterfactuals", Artificial Intelligence, 57, pp. 227-270.
11. Grégoire, É., Mazure, B. and Saïs, L. (1998), "Logically-complete local search for propositional nonmonotonic knowledge bases", In: Proc. 7th Int. Workshop on Nonmonotonic Reasoning, Niemelä I. and Schaub T, (eds.), Trento, pp. 37-45.
12. Grégoire, É. and Saïs, L. (1999), "A fast logically-complete preferential reasoner based on local search" (submitted, available from the autors).
13. Hansen, P. and Jaumard (1990), "Algorithms for the maximum satisfiability problem", Tour«, of Computing, 22, pp. 279-303.
14. Mazure, B., Saïs, L., Grégoire, É. (1997a), « Tabu Search for SAT », In: Proc. of the 14th Nat. Conf. on Artificial Intelligence (AAAI-97), Rhode Island, pp. 281-285.
15. Mazure, B., Saïs, L. and Grégoire, É. (1997b), «Checking several forms of consistency in non-monotonic knowledge-bases», In: Proc. ECSQARU-FAPR97, Gabbay, D., Kruse, R., Nonnengart, A and Juergen, H.J, (eds), Lecture Notes in Computer Science 1244, Springer, pp. 122-130.
16. Mazure, B., Saïs, L. and Grégoire, E. (1997c), «An Efficient Technique to Ensure the Logical Consistency of Cooperative Agents», Int. Journ. of Cooperative Information Systems, World Scientific, 6(1), pp. 27-36.
17. Mazure, B., Saïs, L. and Grégoire, É. (1998a), « Boosting Complete Techniques Thanks to Local Search Methods », Ann. of Math, and Artificial Intelligence, 22, pp. 319-322.
18. th Int. Conf. on Automated Deduction (CADE’15), Lecture Notes in Computer Science 1421, Kirchner C. and Kirchner H. (eds.), Springer, pp. 124-128.
19. McAllester, D., Selman, B. and Kautz, H. (1997), "Evidence for Invariants in Local Search", In: Proc. of the 14th Nat. Conf. on Artificial Intelligence (AAAI-97), pp. 321-326.
20. Nebel, B. (1996), "How hard is it to revise a belief base", Report 83, Institut für Informatik, Universität Freiburg.
21. Reiter, R. (1987), «A theory of diagnosis from first principles», Artificial Intelligence, 32, pp. 57-95.
22. Selman, B., Levesque, H. and Mitchell. D. (1992), «A New Method for Solving Hard Satisfiability Problems», In: Proc. of the 14th Nat. Conf. on Artificial Intelligence (AAAI-97), pp. 440-446.
23. Selman, B., Kautz, H. A. and Cohen, B. (1993), «Local Search Strategies for Satisfiability Testing», In: Proc. 1993 DIMACS Workshop on Maximum Clique, Graph Coloring, and Satisfiability.
24. Selman, B., Kautz, H. and McAllester, D. (1997), "Computational Challenges in Propositional Reasoning and Search", In: Proc. of the 15th Int. Joint Conf. on Artificial Intelligence (IJCAI-97), Nagoya, Japan, pp. 50-54.