Postulates for logic-based argumentation systems
... by various logics satisfying Tarski’s axioms and by different attack relations. The formalism is devoted for reasoning about inconsistent knowledge. Thus, it should enjoy some properties (referred to as postulates) in order to be deemed acceptable. Two families of postulates can be defined: ...
... by various logics satisfying Tarski’s axioms and by different attack relations. The formalism is devoted for reasoning about inconsistent knowledge. Thus, it should enjoy some properties (referred to as postulates) in order to be deemed acceptable. Two families of postulates can be defined: ...
A Computational Model of Belief - Rochester CS
... believes ϕ, and believing ϕ would cause me to believe ψ as well, then according to the possible worlds model I am justified in concluding that John believes ψ (assuming that my leap from ϕ to ψ is justified). However, the possible worlds model is unreasonable from a computational standpoint. It is w ...
... believes ϕ, and believing ϕ would cause me to believe ψ as well, then according to the possible worlds model I am justified in concluding that John believes ψ (assuming that my leap from ϕ to ψ is justified). However, the possible worlds model is unreasonable from a computational standpoint. It is w ...
Logical Foundations for Belief Representation WILLIAM J.
... But when it is taken as a subject concerned with the representation of information in AI systems, its epistemic connotation comes to the fore. In this context, however, more than mere knowledge is being represented. For what is represented are such things as objects, properties, situations, and prop ...
... But when it is taken as a subject concerned with the representation of information in AI systems, its epistemic connotation comes to the fore. In this context, however, more than mere knowledge is being represented. For what is represented are such things as objects, properties, situations, and prop ...
pdf file
... Let L be a nonempty language whose elements are denoted by φ, ψ, χ; P(X) denotes the power set of the set X. An operation C : P(L) → P(L) is called an inference operation, and the pair (L, C) is said to be an inference system. The operation C represents the notion of logical inference. An inference ...
... Let L be a nonempty language whose elements are denoted by φ, ψ, χ; P(X) denotes the power set of the set X. An operation C : P(L) → P(L) is called an inference operation, and the pair (L, C) is said to be an inference system. The operation C represents the notion of logical inference. An inference ...
Awareness, negation and logical omniscience
... knowledge and belief, since knowledge and beliefs are simply represented by an arbitrary set of formulas. For artificial agents such as robots, computers, or knowledge-bases, deduction models of beliefs may be reasonable. However, for rational agents such as humans, even intelligent artificial agent ...
... knowledge and belief, since knowledge and beliefs are simply represented by an arbitrary set of formulas. For artificial agents such as robots, computers, or knowledge-bases, deduction models of beliefs may be reasonable. However, for rational agents such as humans, even intelligent artificial agent ...
pdf file
... occurs when the observation information is contradictory: for some of the attributes not any value is possible. Underspecification can lead to an approximation (an upper bound) of the solution of the classification: a set of possibilities, one of which is the right solution. If the number of observa ...
... occurs when the observation information is contradictory: for some of the attributes not any value is possible. Underspecification can lead to an approximation (an upper bound) of the solution of the classification: a set of possibilities, one of which is the right solution. If the number of observa ...
A Dynamic Knowledge Base - K
... 2.1 Sport and History Domains . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2.2 The Oncological Domain . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ...
... 2.1 Sport and History Domains . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2.2 The Oncological Domain . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ...
On Revising Fuzzy Belief Bases
... often referred-to distinction made in the belief revision literature (e.g. [15, p. 22]), our approach will be foundationalist rather than coherentist. That is, we differentiate between those beliefs which are “basic” or “explicit”, (u) and those which are “merely derived” or “implicit” (i.e., that i ...
... often referred-to distinction made in the belief revision literature (e.g. [15, p. 22]), our approach will be foundationalist rather than coherentist. That is, we differentiate between those beliefs which are “basic” or “explicit”, (u) and those which are “merely derived” or “implicit” (i.e., that i ...
Strong Cyclic Planning with Incomplete Information and Sensing
... either known to be true or known to be false. This form of epistemic disjunction is specifically treated in our algorithm (see (De Giacomo et al. 1997; Iocchi et al. 2000)), while other forms of epistemic disjunction are not allowed. Notice also that this notion is different from that of noisy senso ...
... either known to be true or known to be false. This form of epistemic disjunction is specifically treated in our algorithm (see (De Giacomo et al. 1997; Iocchi et al. 2000)), while other forms of epistemic disjunction are not allowed. Notice also that this notion is different from that of noisy senso ...
rene-witte.net - Semantic Scholar
... the grammatical construct of reported speech. This allows a clear assignment of statements to sources and enables the system to judge according to different degrees of reliability in a source. Our approach differs from existing work by addressing two different problems usually dealt with in isolatio ...
... the grammatical construct of reported speech. This allows a clear assignment of statements to sources and enables the system to judge according to different degrees of reliability in a source. Our approach differs from existing work by addressing two different problems usually dealt with in isolatio ...
Generating New Beliefs From Old Fahiem Bacchus Adam J. Grove Joseph Y. Halpern
... clear that these beliefs should have some relation to objective reality. One way of guaranteeing this is to actually generate them from the objective information available to the agent. Several ways of doing this have been considered in the literature; for example, [BGHK92, PV92] each discuss severa ...
... clear that these beliefs should have some relation to objective reality. One way of guaranteeing this is to actually generate them from the objective information available to the agent. Several ways of doing this have been considered in the literature; for example, [BGHK92, PV92] each discuss severa ...
A sentential view of implicit and explicit belief
... inferential capabilities will play a role in their definition. For suppose that Ralph can believe ~b and ~ ~ ~ without inferring ~. Then there will be epistemic alternatives in which ~ and D ~ are true, but ~ is not. On the other hand, if Ralph always infers ~ from ~ and ~ D ~, then all epistemic al ...
... inferential capabilities will play a role in their definition. For suppose that Ralph can believe ~b and ~ ~ ~ without inferring ~. Then there will be epistemic alternatives in which ~ and D ~ are true, but ~ is not. On the other hand, if Ralph always infers ~ from ~ and ~ D ~, then all epistemic al ...
Quantitatively Evaluating Formula-Variable Relevance by
... Acknowledgements. The authors wish to thank Chaosheng Fan, Kedian Mu, Geng Wang, Dai Xu, Xiaowang Zhang, and other people with whom we have had discussions on this topic. We would also like to thank the anonymous reviewers for the helpful comments. This work is supported by the program of the Nation ...
... Acknowledgements. The authors wish to thank Chaosheng Fan, Kedian Mu, Geng Wang, Dai Xu, Xiaowang Zhang, and other people with whom we have had discussions on this topic. We would also like to thank the anonymous reviewers for the helpful comments. This work is supported by the program of the Nation ...
Planning with Different Forms of Domain
... A central issue in incorporating domain-dependent control knowledge into a planner is to identify the classes of knowledge to incorporate and to devise a means of representing and reasoning with this knowledge. In the past, planners such as TLPlan and TALplan have exploited domain-dependent temporal ...
... A central issue in incorporating domain-dependent control knowledge into a planner is to identify the classes of knowledge to incorporate and to devise a means of representing and reasoning with this knowledge. In the past, planners such as TLPlan and TALplan have exploited domain-dependent temporal ...
Consistent Belief Reasoning in the Presence of Inconsistency
... We define a situation s to be more complete than s' (denoted by s <~ s') if 0 ( s ) C O(s'). Define the set of most-complete situations in S to be MC(S) = {s ] s E S, ~ s' E S such that s ~ <~ s}. Similar orders for comparing two situations were also used in the logics of [Pri91] and [KL89]. Most-co ...
... We define a situation s to be more complete than s' (denoted by s <~ s') if 0 ( s ) C O(s'). Define the set of most-complete situations in S to be MC(S) = {s ] s E S, ~ s' E S such that s ~ <~ s}. Similar orders for comparing two situations were also used in the logics of [Pri91] and [KL89]. Most-co ...
Kalos - A Syste with Revision
... The stylistic revisor cycle begins after all conceptual revisions are complete. This cycle begins with the stylistic revisor, which reviews the draft text and produces revision suggestions to improve it. These suggestions go to the surface generator, which uses them to regenerate the text. This cycl ...
... The stylistic revisor cycle begins after all conceptual revisions are complete. This cycle begins with the stylistic revisor, which reviews the draft text and produces revision suggestions to improve it. These suggestions go to the surface generator, which uses them to regenerate the text. This cycl ...
7. Propositional Logic Rational Thinking, Logic, Resolution
... Resolution is a refutation-complete proof process. There are others (Davis-Putnam Procedure, Tableaux Procedure, . . . ). In order to implement the process, a strategy must be developed to determine which resolution steps will be executed and when. In the worst case, a resolution proof can take expo ...
... Resolution is a refutation-complete proof process. There are others (Davis-Putnam Procedure, Tableaux Procedure, . . . ). In order to implement the process, a strategy must be developed to determine which resolution steps will be executed and when. In the worst case, a resolution proof can take expo ...
Belief Revision in Multi-Agent Systems
... SYSTEMS This section briefly describes the fundamentals of belief revision systems (section 2.1), before the key principles and concepts of belief revision in multi-agent systems are expounded (section 2.2). ...
... SYSTEMS This section briefly describes the fundamentals of belief revision systems (section 2.1), before the key principles and concepts of belief revision in multi-agent systems are expounded (section 2.2). ...
Compositional Belief Update
... In this paper we explore a class of belief update operators, in which the definition of the operator is compositional with respect to the sentence to be added. The goal is to provide an update operator that is intuitive, in that its definition is based on a recursive decomposition of the update senten ...
... In this paper we explore a class of belief update operators, in which the definition of the operator is compositional with respect to the sentence to be added. The goal is to provide an update operator that is intuitive, in that its definition is based on a recursive decomposition of the update senten ...
Propositional Fragments for Knowledge
... restrictions are put on the prefix of the input: if no alternations of quantifiers occur, the problem reduces to the satisfiability problem or to the validity problem, and both of them are in P for OBDD< formulae; if the prefix is of the form ∀S1 ∃S2 , the problem is Πp1 -complete (= coNP-complete); ...
... restrictions are put on the prefix of the input: if no alternations of quantifiers occur, the problem reduces to the satisfiability problem or to the validity problem, and both of them are in P for OBDD< formulae; if the prefix is of the form ∀S1 ∃S2 , the problem is Πp1 -complete (= coNP-complete); ...
Belief Base Change Operations for Answer Set Programming
... are reflected by the corresponding postulates for the revision of belief sets (Alchourron, Gärdenfors, and Makinson 1985). The postulates of Success and Consistency are identical and the postulates Inclusion and Vacuity only differ in the expansion operator. In addition to these four postulates the ...
... are reflected by the corresponding postulates for the revision of belief sets (Alchourron, Gärdenfors, and Makinson 1985). The postulates of Success and Consistency are identical and the postulates Inclusion and Vacuity only differ in the expansion operator. In addition to these four postulates the ...
Considerations on Belief Revision in an Action Theory
... with every set of possible worlds. Arguably, Example 1 illustrates that this is inappropriate in an action context, in that the result of an action will give information that will affect the results of revision. Thus, in Example 1 the agent should not believe that the paper is litmus paper after the ...
... with every set of possible worlds. Arguably, Example 1 illustrates that this is inappropriate in an action context, in that the result of an action will give information that will affect the results of revision. Thus, in Example 1 the agent should not believe that the paper is litmus paper after the ...
A New Operator for ABox Revision in DL-Lite Sibei Gao Guilin Qi
... the problem of incorporating a new ontology into an old one consistently. This problem is important as DLs underpin W3C standard Web ontology language OWL and ontologies may evolve during their construction. Existing revision operators in DLs are mostly generalizations of belief revision operators i ...
... the problem of incorporating a new ontology into an old one consistently. This problem is important as DLs underpin W3C standard Web ontology language OWL and ontologies may evolve during their construction. Existing revision operators in DLs are mostly generalizations of belief revision operators i ...
Arbitrary Announcements in Propositional Belief Revision
... Public announcements cause each agent in a group to modify their beliefs to incorporate some new piece of information, while simultaneously being aware that all other agents are doing the same. Given some fixed goal formula, it is natural to ask if there exists an announcement that will make the for ...
... Public announcements cause each agent in a group to modify their beliefs to incorporate some new piece of information, while simultaneously being aware that all other agents are doing the same. Given some fixed goal formula, it is natural to ask if there exists an announcement that will make the for ...