Computer Science – Logic in Computer Science
Scientific paper
2000-02-18
Computer Science
Logic in Computer Science
10 pages, 1 figure, A preliminary version of this paper appeared in the form of an extended abstract in the conference Mathema
Scientific paper
The different semantics that can be assigned to a logic program correspond to different assumptions made concerning the atoms whose logical values cannot be inferred from the rules. Thus, the well founded semantics corresponds to the assumption that every such atom is false, while the Kripke-Kleene semantics corresponds to the assumption that every such atom is unknown. In this paper, we propose to unify and extend this assumption-based approach by introducing parameterized semantics for logic programs. The parameter holds the value that one assumes for all atoms whose logical values cannot be inferred from the rules. We work within multi-valued logic with bilattice structure, and we consider the class of logic programs defined by Fitting. Following Fitting's approach, we define a simple operator that allows us to compute the parameterized semantics, and to compare and combine semantics obtained for different values of the parameter. The semantics proposed by Fitting corresponds to the value false. We also show that our approach captures and extends the usual semantics of conventional logic programs thereby unifying their computation.
Loyer Yann
Spyratos Nicolas
Stamate Daniel
No associations
LandOfFree
Computing and Comparing Semantics of Programs in Multi-valued Logics does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Computing and Comparing Semantics of Programs in Multi-valued Logics, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computing and Comparing Semantics of Programs in Multi-valued Logics will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-459547