Nothing Special   »   [go: up one dir, main page]

×
Please click here if you are not redirected within a few seconds.
Jul 23, 2010 · In this paper, we generalize the notions of completion and loop formulas of logic programs to description logic programs and show that the ...
In this paper, we generalize the notions of completion and loop formulas of logic programs to description logic programs and show that the answer sets of a dl- ...
In this paper, we generalize the notions of completion and loop formulas of logic programs to description logic programs and show that the answer sets of a dl- ...
In this paper, we generalize the notions of completion and loop formulas of logic programs to description logic programs and show that the answer sets of a dl- ...
Loop formulas for description logic programs. 535. A dl-atom A is monotonic relative to a dl-program K = (O, P) if I |=O A implies. I. |=O A, for all I ⊆ I.
Jul 23, 2010 · In this paper, we generalize the notions of completion and loop formulas of logic programs to description logic programs and show that the ...
Shen, Loop formulas for description logic programs, in: Theory and Practice of Logic Programming, 26th Int'l. Conference on Logic Programming (ICLP'10) ...
Jan 20, 2012 · In this paper, we generalize the notions of completion and loop formulas of logic programs to description logic programs and show that the ...
Abstract. We formulate loop formulas for logic programs with arbitrary constraint atoms, for the semantics based on conditional sat- isfaction.
Missing: description | Show results with:description
Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev. Hosted as a part of SLEBOK on ...