Textual inference by combining multiple Logic programming paradigms

AAAI Workshop - Technical Report

Volumn WS-05-05, Issue , 2005, Pages 1-5

  Baral, Chitta ^a   Gelfond, Gregory ^b   Gelfond, Michael ^b   Scinerl, Richard B ^c  

^a ARIZONA STATE UNIVERSITY   (United States)

^b TEXAS TECH UNIVERSITY   (United States)

^c MONMOUTH UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT LOGIC PROGRAMMING; DEFAULTS; MULTIPLE LOGIC PROGRAMMING; TEXTUAL INFERENCES;

COMPUTER PROGRAMMING LANGUAGES; COMPUTER SOFTWARE; CONSTRAINT THEORY; INFORMATION RETRIEVAL; KNOWLEDGE ACQUISITION; KNOWLEDGE BASED SYSTEMS; QUERY LANGUAGES;

LOGIC PROGRAMMING;

EID: 33646051511     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. Baral, C., and Gelfond, M. 2000. Reasoning agents in dynamic domains. In Minker, J., ed., Logic Based AI. Kluwer.
2. Baral, C. 2003. Knowledge representation, reasoning and declarative problem solving. Cambridge University Press.
3. Frühwirth, T., and Abdennadher, S. 2002. Essentials of Constraint Programming. Berlin, Germany: Springer.
4. Gelfond, M., and Lifschitz, V. 1988. The stable model semantics for logic programming. In Kowalski, R., and Bowen, K., eds., Logic Programming: Proc. of the Fifth Int'l Conf. and Symp., 1070-1080. MTT Press.
5. Gelfond, M., and Lifschitz, V. 1991. Classical negation in logic programs and disjunctive databases. New Generation Computing 9:365-387.
6. Jaffar, J., and Lassez, J.-L. 1987. Constraint logic programming. In Proceedings of the 14th ACM Principles of Programming Languages Conference, 111-119.
7. Lierler, Y., and Maratea, M. 2004. Cmodels-2: SAT-based Answer Sets Solver Enhanced to Non-tight Programs. In Proceedings of LPNMR-7, 346.
8. Marriott, K., and Stuckey, P. J. 1998. Programming with Constraints. Cambridge, Massachusetts: The MIT Press.
9. McCarthy, J., and Hayes, P. 1969. Some philosophical problems from the standpoint of artificial intelligence. In Meltzer, B., and Michie, D., eds., Machine Intelligence 4. Edinburgh, Scotland: Edinburgh University Press. 463-502.
10. Niemela, I., and Simons, P. 1997a. A deductive system for nonmonotonic reasoning. In Proceedings of the 4th Logic Programming and Non-Monotonie Reasoning Conference - LPNMR '97, LNAI1265, 363-374. Dagstuhl, Germany: Springer-Verlag.
11. Niemela, I., and Simons, P. 1997b. Smodels - an implementation of the stable model and well-founded semantics for normal logic programs. In Proc. 4th international conference on Logic programming and non-monotonic reasoning, 420-429.
12. Reingold, E., and Dershowitz, N. 2001. Calendrical Calculations: The Millennium Edition. Cambridge University Press.
13. Turner, H. 1997. Representing actions in logic programs and default theories. Journal of Logic Programming 31(1-3):245-298.
14. Van Hentenryk, P. 1989. Constraint Satisfaction in Logic Programming. Cambridge, MA: MIT Press.