Karl Schlechta. Filters and partial orders. Journal of the Interest Group in Pure and Applied Logics, 5(5):753-772, 1997. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Nonmonotonic Logics and Semantics - Lehmann (2001) (Correct)
....of Tarski s semantic analysis will be reviewed now. Its origins may be traced to Dubois and Prade [8] and BenDavid and Ben Eliyahu [4] Up to small technical changes, our presentation will be that of Friedman and Halpern [14, 15] The connection between 12 both approaches is described in [33]. Some more results concerning the link between plausibility measures and preferential relations may be found in [10] Suppose we had some way of measuring the size or the importance of sets of models. One is tempted to say that a formula a may be deduced from a set A of formulas i the measure of ....
Karl Schlechta. Filters and partial orders. Journal of the Interest Group in Pure and Applied Logics, 5(5):753-772, 1997.
A Modal Logic for Subjective Default Reasoning - Ben-David, Ben-Eliyahu-Zohary (1994) (1 citation) (Correct)
....in order to define semantics for default reasoning for which the KLM system is not complete. Similar to us, Friedman and Halpern show how their semantic structure can be tailored to represent different set of inference rules by using different axioms for defining the semantic structure. Schlechta [Sch97] has proved that the semantics of Friedman and Halpern is equivalent to ours. Lehmann [Leh98] has suggested a generalization of Tarski s monotonic de2 ductive operations and showed that it characterizes the family of operations defined by qualitative plausibility measures and by one of our ....
Karl Schlechta. Filters and partial orders. Journal of the Interest Group in Pure and Applied Logics, 5(5):753--772, 1997.
Nonmonotonic Logics and Semantics - Lehmann (2000) (Correct)
....of Tarski s semantic analysis will be reviewed now. Its origins may be traced to Dubois and Prade [8] and BenDavid and Ben Eliyahu [4] Up to small technical changes, our presentation will be that of Friedman and Halpern [14, 15] The connection between 12 both approaches is described in [33]. Some more results concerning the link between plausibility measures and preferential relations may be found in [10] Suppose we had some way of measuring the size or the importance of sets of models. One is tempted to say that a formula a may be deduced from a set A of formulas iff the measure ....
Karl Schlechta. Filters and partial orders. Journal of the Interest Group in Pure and Applied Logics, 5(5):753--772, 1997.
Modeling Beliefs In Dynamic Systems - Friedman (1997) (8 citations) (Correct)
....using the general technique of Lemma 2.4.1. In most cases, we can also establish a direct relationship between these semantics and plausibility measures. For example, the coherent filters approach of [Ben David and Ben Eliyahu 1994; Schlechta 1995] can be mapped to plausibility, as shown by Schlechta [1996], and Weydert s full ranking measures [1994a] are easily seen to be a special case of plausibility measures. 2.5 Default Entailment in Plausibility Structures In this section we characterize default entailment in plausibility structures. To do so, it is useful to have a somewhat more general ....
Schlechta, K. (1996). Filters and partial orders. Submitted for publication.
Plausibility Measures and Default Reasoning - Friedman (1996) (19 citations) (Correct)
....using the general technique of Lemma 4.1. In most cases, we can also establish a direct relationship between these semantics and plausibility measures. For example, the coherent filters approach of [Ben David and Ben Eliyahu 1994; Schlechta 1995] can be mapped to plausibility, as shown by Schlechta [1996], and Weydert s full ranking measures [1994a] are easily seen to be a special case of plausibility measures. 5. DEFAULT ENTAILMENT IN PLAUSIBILITY STRUCTURES In this section we characterize default entailment in plausibility structures. To do so, it is useful to have a somewhat more general ....
Schlechta, K. 1996. Filters and partial orders. Submitted for publication.
Distance Based Revision Of Preferential Logics - Audibert, Lhoussaine, Schlechta (1998) Self-citation (Schlechta) (Correct)
.... models of a representing preferential structure, second, by an order on the set of formulas of the language defined by the j relation: ff :fi ff fi iff ff j fi: This or similar relations are basic to many abstract approaches to nonmonotonic reasoning (see [KLM90] LM92] BB94] FH95] [Sch97 4]) We recall this now. 2.3.1 PREFERENTIAL LOGICS AND PARTIAL ORDERS The system P correponds to logics defined by preferential models (see [KLM90] LM92] we recall it first. Definition 2.7 (Axioms of P and R; see [Gab85] KLM90] LM92] Strictly speaking i.e. in object language , the ....
....ff j :fl or ff fl j fi; 8. Cumulativity (CUM) ff j fi implies (ff j fl , ff fi) j fl) The system P consists of 1 6, R of 1 7, 8 is a consequence of P: There are various abstract ways to consider a logic, among them as a coherent system of filters (or, dually, ideals) see [BB94] [Sch97 4], or as a partial order defined of the set of formulas, see [FH95] We recall some definitions now and discuss (informally) the connection with the systems P and R: Definition 2.8 Let X be any set. P will be the power set operator. F P(X) is a filter over X iff (1) X 2 F ; 2) A 2 F ; A ....
K.Schlechta: "Filters and Partial Orders", Journal of the Interest Group in Pure and Applied Logics, Vol. 5, No. 5, p: 753-772, 1997
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC