Hybrid rules with well-founded semantics

Knowledge and Information Systems

Volumn 25, Issue 1, 2010, Pages 137-168

  Drabent, Włodzimierz ^a,b   Małuszyński, Jan ^b  

^a INSTITUTE OF COMPUTER SCIENCE   (Poland)

^b LINKÖPING UNIVERSITY   (Sweden)

Author keywords

Constraint logic programming; Constructive negation; Integration of rules and ontologies; Knowledge representation; Semantic web reasoning; Well founded semantics

Indexed keywords

COMPUTER CIRCUITS; DATA DESCRIPTION; INTEGRATION; KNOWLEDGE REPRESENTATION; ONTOLOGY; PROLOG (PROGRAMMING LANGUAGE); XML;

CONSTRAINT LOGIC PROGRAMMING; CONSTRAINT SOLVERS; CONSTRUCTIVE NEGATION; DECLARATIVE SEMANTICS; FIRST ORDER THEORIES; HYBRID IMPLEMENTATION; OPERATIONAL SEMANTICS; WELL FOUNDED SEMANTICS;

LOGIC PROGRAMMING;

EID: 77957561213     PISSN: 02191377     EISSN: 02193116     Source Type: Journal    
DOI: 10.1007/s10115-010-0300-5     Document Type: Article

References (40)

1. Antoniou G, Damásio CV, Grosof B, Horrocks I, Kifer M, Małuszyński J, Patel-Schneider PF (2005) Combining rules and ontologies. a survey. FP6 NoE REWERSE, Deliverable I3-D3, Available at. http://rewerse. net/deliverables/m12/i3-d3. pdf.
2. Apt KR (1997) From logic programming to prolog, International series in computer science. Prentice-Hall, Englewood Cliffs.
3. Apt KR, Bol RN (1994) Logic programming and negation: a survey. J Log Program 19/20: 9-71.
4. Baader, F, Calvanese, D, McGuiness, D, Nardi, D, Patel-Schneider, P (eds) (2003) The description logic handbook. Cambridge University Press, Cambridge.
5. Baral C, Gelfond M (1994) Logic programming and knowledge representation. J Log Program 19/20: 73-148.
6. Clark KL (1978) Negation as failure. In: Gallaire H, Minker J (eds) Logic and databases. Plenum Press, New York, pp 293-322.
7. de Bruijn J, Eiter T, Tompits H (2008) Embedding approaches to combining rules and ontologies into autoepistemic logic. In: Brewka G, Lang J (eds) KR. AAAI Press, pp 485-495.
8. de Bruijn J, Pearce D, Polleres A, Valverde A (2007) Quantified equilibrium logic and hybrid rules. In: Marchiori et al. [29] pp 58-72.
9. Dix J, Stolzenburg F (1998) A framework to incorporate non-monotonic reasoning into constraint logic programming. J Log Program 37(1-3): 47-76.
10. Donini F, Lenzerini M, Nardi D, Schaerf A (1998) AL-Log: integrating datalog and description logics. Int Inf Syst 10(3): 227-252.
11. Drabent W (1993) SLS-resolution without floundering. In: Pereira LM, Nerode A (eds) Proceedings of 2nd international workshop on logic programming and non-monotonic reasoning. MIT Press, pp 82-98.
12. Drabent W (1995) What is failure? An approach to constructive negation. Acta Inform 32(1): 27-59.
13. Drabent W, Eiter T, Ianni G, Krennwallner T, Lukasiewicz T, Małuszyński J (2009) Hybrid reasoning with rules and ontologies. In: Bry F, Małuszyński J (eds) Semantic techniques for the web. The REWERSE perspective, vol 5500 of lecture notes in computer science. Springer, pp 1-49.
14. Drabent W, Henriksson J, Małuszyński J (2007a) HD-rules: a hybrid system interfacing prolog with DL-reasoners. In: Proceedings of the ICLP'07 workshop on applications of logic programming to the web, semantic web and semantic web services (ALPSWS2007), CEUR workshop proceedings, vol 287. http://www. ceur-ws. org/Vol-287. Updated version of (Drabent et al. [15]).
15. Drabent W, Henriksson J, Małuszyński J (2007b) Hybrid reasoning with rules and constraints under well-founded semantics, In: Marchiori et al. [29] pp 348-357.
16. Drabent W, Małuszyński J (2007) Well-founded semantics for hybrid rules. In: Marchiori et al. [29] pp 1-15.
17. Eiter T, Ianni G, Schindlauer R, Tompits H (2006) Effective integration of declarative rules with external evaluations for semantic-web reasoning. In: Sure Y, Domingue J (eds) ESWC vol 4011 of lecture notes in computer science, Springer, pp 273-287.
18. Eiter T, Lukasiewicz T, Schindlauer R, Tompits H (2004a) Combining answer set programming with description logics for the semantic web. In: Proceedings of the international conference of knowledge representation and reasoning (KR'04). http://citeseer. ist. psu. edu/eiter04combining. html.
19. Eiter T, Lukasiewicz T, Schindlauer R, Tompits H (2004b) Well-founded semantics for description logic programs in the semantic web. In: Antoniou G, Boley H (eds) RuleML vol 3323 of lecture notes in computer science. Springer, pp 81-97.
20. Fages F (1997) Constructive negation by pruning. J Log Program 32(2): 85-118.
21. Ferrand G, Deransart P (1993) Proof method of partial correctness and weak completeness for normal logic programs. J Log Program 17(2/3& 4): 265-278.
22. Gelfond M, Lifschitz V (1988) The stable model semantics for logic programming. In: Kowalski RA, Bowen K (eds) Proceedings of the fifth international conference on logic programming. The MIT Press, Cambridge, Massachusetts, pp 1070-1080.
23. Gruber TR (1995) Towards principles for the design of ontologies used for knowledge sharing. J Hum Comput Stud 43: 907-928.
24. Horrocks I, Patel-Schneider PF (2004) A proposal for an OWL rules language. WWW '04: Proceedings of the 13th international conference on World Wide Web. ACM, New York, NY, USA, pp 723-731.
25. Kunen K (1987) Negation in logic programming. J Log Program 4(4): 289-308.
26. Levy A, Rousset M-C (1998) Combining horn rules and description logics in carin. Artif Intell 104(1-2): 165-209.
27. Lloyd JW (1987) Foundations of logic programming, second extended edn. Springer, Berlin.
28. Małuszyński J (2009) Integration of rules and ontologies. In: Liu L, Özsu MT (eds) Encyclopedia of database systems. Springer US, pp 1546-1551.
29. Marchiori M, Pan JZ, de Sainte Marie C (eds) (2007) Web reasoning and rule systems, first international conference, RR 2007, Innsbruck, Austria, June 7-8, 2007, Proceedings, vol 4524 of lecture notes in computer science, Springer.
30. Marriott K, Stuckey PJ, Wallace M (2006) Constraint logic programming. Handbook of constraint programming. Elsevier, Amsterdam.
31. Motik B, Rosati R (2007) A faithful integration of description logics with logic programming. In: Veloso MM (ed) IJCAI 2007, Proceedings of the 20th international joint conference on artificial intelligence. pp 477-482.
32. Motik B, Sattler U, Studer R (2005) Query answering for OWL-DL with rules. J Web Sem 3(1): 41-60.
33. Patel-Schneider PF, Hayes P, Horrocks I (2004) OWL web ontology language semantics and abstract syntax, W3C Recommendation. Available at. http://www. w3. org/TR/owl-semantics/.
34. Przymusinski TC (1989) On the declarative and procedural semantics of logic programs. J Autom Reason 5: 167-205.
35. Rosati R (2005) On the decidability and complexity of integrating ontologies and rules. J Web Semant 3: 61-73.
36. Rosati R (2006) DL + log: tight integration of description logics and disjunctive datalog. In: Doherty P, Mylopoulos J, Welty CA (eds) KR. AAAI Press, Menlo Park, pp 68-78.
37. Sagonas C, Swift T, Warren DS et al. (2007) The XSB system. Volume1: programmer's manual. Available at. http://xsb. sourceforge. net.
38. Shoenfield JR (1967) Mathematical logic. Addison-Wesley, Reading.
39. Stuckey PJ (1995) Negation and constraint logic programming. Inf Comput 118(1): 12-33.
40. van Gelder A, Ross KA, Schlipf JS (1988) Unfounded sets and well-founded semantics for general logic programs. Principles of database systems. ACM, pp 221-230.