Forgetting literals with varying propositional symbols

Journal of Logic and Computation

Volumn 17, Issue 5, 2007, Pages 955-982

  Moinard, Yves ^a  

^a CAMPUS DE BEAULIEU   (France)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATIC PROGRAMMING; COMPUTATION THEORY; PROBLEM SOLVING; SEMANTICS; SYNTACTICS;

AUTOMATIC COMPUTATION; SYNTACTICAL CHARACTERIZATIONS; VARYING PROPOSITIONAL SYMBOLS;

CODES (SYMBOLS);

EID: 35348886686     PISSN: 0955792X     EISSN: 1465363X     Source Type: Journal    
DOI: 10.1093/logcom/exm049     Document Type: Conference Paper

References (14)

1. A. Darwiche. Decomposable negation normal form. Journal of the ACM, 48, 608-647, 2001.
2. A. Darwiche and P. Marquis. A knowledge compilation map. Journal of Artificial Intelligence Research, 17, 229-264, 2002.
3. J. Lang, P. Liberatore, and P. Marquis. Propositional Independence - Formula-Variable Independence and Forgetting. Journal of Artificial Intelligence Research, 18, 391-443, 2003. Available at: http://WWW.JAIR.ORG/
4. V. Lifschitz. Circumscription. In Handbook of Logic in Artificial Intelligence and Logic Programming, Volume 3, Non-Monotonic and Uncertainty Reasoning, D. M. Gabbay, C. J. Hogger and J. A. Robinson, eds, pp. 297-352. Oxford University Press, 1994.
5. F. Lin. On strongest necessary and weakest sufficient conditions. Artficial Intelligence, 128, 143-159, 2001.
6. F. Lin and R. Reiter. Forget it! In AAAI Fall Symposium on Relevance, C. S. Mellish, ed., pp. 1985-1991, Morgan Kaufmann, 1994.
7. J. McCarthy. Application of circumscription to formalizing common sense knowledge. Artificial Intelligence, 28, 89-116, 1986.
8. Y. Moinard and R. Rolland. Circumscriptions from what they cannot do. In Common Sense'98, pp. 20-41, London, 1998. Available at: http://www.ida.liu.se/ext/etai/nj/fcs-98/listing.html
9. Y. Moinard and R. Rolland. Propositional circumscriptions. Technical Report, Research Report RR-3538, INRIA, Rennes, France, 1998.
10. T. C. Przymusinski. An Algorithm to Compute Circumscription. Artificial Intelligence, 38, 49-73, 1989.
11. M. Ryan. Defaults and revision in structured theories. In Proceedings of the LICS, pp. 362-373, 1991. IIIE Computer Society Press.
12. P. Siegel and L. Forget. A representation theorem for preferential logics. In Proceedings of the KR'96, L. Carlucci Aiello, J. Doyle and S. Shapiro, eds, pp. 453-460, 1996. Morgan Kaufmann.
13. K. Su, G. Lv, and Y. Zhang. Reasoning about knowledge by variable forgetting. In Proceedings of the KR'04, D. Dubois, C. A. Welty and M.-A. Williams, eds, pp. 576-586. AAAI Press, 2004.
14. M. A. Suchenek. First-order syntactic characterizations of minimal entailment, domainminimal entailment, and Herbrand entailment. Journal of Automated reasoning, 10, 237-263, 1993.