Logic programming with solution preferences

Journal of Logic and Algebraic Programming

Volumn 78, Issue 1, 2008, Pages 1-21

  Guo, Hai Feng ^a   Jayaraman, Bharat ^b  

^a UNIVERSITY OF NEBRASKA AT OMAHA   (United States)

^b State University of New York at Buffalo ^*  (United States)

Author keywords

Fixed point; Herbrand model; Logic programming; Preference model; Preferences

Indexed keywords

COMPUTATIONAL LINGUISTICS; COMPUTER PROGRAMMING; COMPUTER SOFTWARE SELECTION AND EVALUATION; INFORMATION THEORY; OPTIMIZATION; SEMANTICS; SOLUTIONS; SYNTACTICS;

COMPUTATIONAL PROBLEMS; DECLARATIVE SEMANTICS; DEFINITE CLAUSES; DISJOINT SETS; FIXED POINT; FIXED POINTS; HERBRAND MODEL; HERBRAND MODELS; LEVEL MAPPINGS; LOGIC PROGRAMS; OPERATIONAL SEMANTICS; PREFERENCE LOGICS; PREFERENCE MODEL; PREFERENCES; RECURSIVE ALGORITHMS; RESOLUTION STRATEGIES; SOLUTION SELECTIONS;

LOGIC PROGRAMMING;

EID: 51749107884     PISSN: 15678326     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jlap.2007.11.003     Document Type: Article

References (33)

1. Bistarelli S., Montanari U., and Rossi F. Semiring-based constraint solving and optimization. J. ACM 44 2 (1997) 201-236
2. Brown A., Mantha S., and Wakayama T. Preference logics: towards a unified approach to non-monotonicity in deductive reasoning. Ann. Math. Artif. Intell. 10 (1994) 233-280
3. Chen W., and Warren D.S. Tabled evaluation with delaying for general logic programs. J. ACM 43 1 (1996) 20-74
4. Chen W., Swift T., and Warren D.S. Efficient top-down computation of queries under the well-founded semantics. J. Logic Programming 24 3 (1995) 161-199
5. Cui B., and Swift T. Preference logic grammars: fixed point semantics and application to data standardization. Artif. Intell. 138 1-2 (2002) 117-147
6. van Emden M.H., and Kowalski R.A. The semantics of predicate logic as a programming language. JAMC 23 4 (1976) 733-742
7. F. Fages, On the semantics of optimization predicates in CLP languages, in: Proc. 13th FST-TCS, 1993.
8. H. Fargier, J. Lang, T. Schiex, Selecting preferred solutions in fuzzy constraint satisfaction problems, in: Proc. 1st European Congress on Fuzzy and Intelligent Technologies (EUFIT), 1993.
9. Freuder E.C., and Wallace R.J. Partial constraint satisfaction. AI J. 58 (1992)
10. S. Ganguly, S. Greco, C. Zaniolo, Minimum and maximum predicates in logic programming, in: Proc. Tenth PODS, 1991.
11. A. Van Gelder, The well-founded semantics of aggregation, in: Proc. ACM 11th Principles of Database Systems, San Diego, 1992, pp. 127-138.
12. K. Govindarajan, B. Jayaraman, S. Mantha, Preference logic programming, in: Proceedings of International Conference on Logic Programming (ICLP), 1995, pp. 731-745.
13. Govindarajan K., Jayaraman B., and Mantha S. Optimization and relaxation in constraint logic languages. POPL (1996) 91-103
14. Hai-Feng, Guo, Gopal, Gupta, A simple scheme for implementing tabled logic programming systems based on dynamic reordering of alternatives, in: Proceedings of International Conference on Logic Programming (ICLP), 2001, pp. 181-196.
15. Jaffar J., and Maher M.J. Constraint logic programming: a survey. J. Logic Programming 19/20 (1994) 503-581
16. Jayaraman B., Govindarajan K., and Mantha S. Preference logic grammars. Computer Languages 24 3 (1998) 179-196
17. Jayaraman B., Osorio M., and Plaisted D. Theory of partial-order programming. Sci. Comput. Programming 34 3 (1999) 207-238
18. Lloyd J.W. Foundations of Logic Programming (1987), Springer-Verlag
19. M.J. Maher, Peter J. Stuckey, Expanding query power in constraint logic programming languages, in: Proceedings of NACLP, 1989.
20. S. Mantha, First-order preference theories and their applications, Ph.D. thesis, University of Utah, November, 1991.
21. Marriott K., and Stuckey P.J. Programming with Constraints: An Introduction (1998), The MIT Press
22. Marriott K., and Stuckey P.J. Semantics of constraint logic programs with optimization. ACM Lett. Programming Languages Systems (LOPLAS) 2 1-4 (1993) 197-212
23. S. Parker, Partial order programming, in: Proc. 16th POPL, 1989.
24. Pereira F.C.N., and Warren D.H.D. Definite clause grammars for language analysis - A survey of the formalism and a comparison with augmented transition networks. Artif. Intell. 13 (1980) 231-278
25. Y.S. Ramakrishna, C.R. Ramakrishnan, I.V. Ramakrishnan, S.A. Smolka, T. Swift, D.S. Warren, Efficient model checking using tabled resolution, in: 9th International Conference on Computer Aided Verification (CAV), 1997, pp. 143-154.
26. R. Rocha, F. Silva, V.S. Costa, On a tabling engine that can exploit or-parallelism, in: ICLP Proceedings, 2001, pp. 43-58.
27. Rossi F., and Sperduti A. Learning solution preferences in constraint problems. J. Exp. Theor. Artif. Intell. 10 (1998)
28. Rossi F., and Sperduti A. Acquiring both constraint and solution preferences in interactive constraint systems. Constraints 9 4 (2004) 311-332
29. Zs. Ruttkay, Fuzzy constraint satisfaction, in: Proc. 3rd IEEE International Conference on Fuzzy Systems, 1994.
30. T. Schiex, Possibilistic constraint satisfaction problems, or "how to handle soft constraints?", in: Proc. 8th Conference of Uncertainty in AI, 1992, pp. 269-275.
31. XSB System. .
32. Wilson M., and Borning A. Hierarchical constraint logic programming. J. Logic Programming 16 (1993) 277-318
33. Zhou N.-F., Shen Y., Yuan L., and You J. Implementation of a linear tabling mechanism. J. Funct. Logic Programming 2001 10 (2001)