Jurgen Dix and Mauricio Osorio. Towards Well-Behaved Semantics Suitable for Aggregation. Technical Report TR 11/97, University of Koblenz, Department of Computer Science, Rheinau 1, April 1997. Accepted at ILPS '97 as poster paper. @ NUS Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A General Theory of Confluent Rewriting Systems for Logic.. - Dix, Osorio, Zepeda (2001) (1 citation) (Correct)
....twice (to replace a in the third and b in the fourth rule) we get P 0 . But WFS (P ) fxg while WFS (P 0 ) We point out that the WFS for both P and P 0 is ; which is considered as a shortcoming of WFS. A semantics stronger than WFS but weaker than WFS is introduced in [DO97c]. 15 The idea of its de nition is to keep the original program and adding more and more atoms to it. This de nes a sequence of sets of atoms A i . These atoms are obtained by applying our old transformations to the program from the last step. Here is the exact de nition: De nition 12 (WFS 2 , ....
....15 The idea of its de nition is to keep the original program and adding more and more atoms to it. This de nes a sequence of sets of atoms A i . These atoms are obtained by applying our old transformations to the program from the last step. Here is the exact de nition: De nition 12 (WFS 2 , [DO97c]) The extended wellfounded semantics, denoted as WFS 2 (P ) is de ned through the following increasing sequence: A 0 = A i 1 : T (P [ A i ) T (P ) fa : a or a :a belongs to norm cs1 (P )g There is the least number n 0 such that An0 = An0 1 (note that A i A i 1 and size(norm cs1 ....
[Article contains additional citation context not shown here]
Jurgen Dix and Mauricio Osorio. Towards Well-Behaved Semantics Suitable for Aggregation. Technical Report TR 11/97, University of Koblenz, Department of Computer Science, Rheinau 1, April 1997. Accepted at ILPS '97 as poster paper.
A General Theory of Confluent Rewriting Systems for Logic.. - Dix, Osorio, Zepeda (1999) (1 citation) Self-citation (Dix Osorio) (Correct)
....twice (to replace a in the third and b in the fourth rule) we get P 0 . But WFS (P ) fxg while WFS (P 0 ) We point out that the WFS for both P and P 0 is ; which is considered as a shortcoming of WFS. A semantics stronger than WFS but weaker than WFS is introduced in [DO97c]. The idea of its definition is to keep the original program and adding more and more atoms to it. This defines a sequence of sets of atoms A i . These atoms are obtained by applying our old transformations to the program from the last step. Here is the exact definition: Definition 12 (WFS 2 , ....
....The idea of its definition is to keep the original program and adding more and more atoms to it. This defines a sequence of sets of atoms A i . These atoms are obtained by applying our old transformations to the program from the last step. Here is the exact definition: Definition 12 (WFS 2 , [DO97c]) The extended wellfounded semantics, denoted as WFS 2 (P ) is defined through the following increasing sequence: A 0 = A i 1 : T (P [ A i ) T (P ) fa : a or a :a belongs to norm cs1 (P )g There is the least number n 0 such that An0 = An0 1 (note that A i A i 1 and ....
[Article contains additional citation context not shown here]
Jurgen Dix and Mauricio Osorio. Towards Well-Behaved Semantics Suitable for Aggregation. Technical Report TR 11/97, University of Koblenz, Department of Computer Science, Rheinau 1, April 1997. Accepted at ILPS '97 as poster paper.
Online articles have much greater impact More about CiteSeer.IST at NUS Add search form to your site Submit documents Feedback
CiteSeer.IST at NUS - Copyright Penn State and NEC. Hosted by the School of Computing, National University of Singapore.