• Aucun résultat trouvé

[PDF] Top 20 Splitting Epistemic Logic Programs

Has 1242 "Splitting Epistemic Logic Programs" found on our website. Below are the top 20 most common "Splitting Epistemic Logic Programs".

Splitting Epistemic Logic Programs

Splitting Epistemic Logic Programs

... the splitting theorem [ 9 ], well-known in standard ASP. Splitting is applicable when the program can be divided into two parts, the bottom and the top, in such a way that the bottom never refers to head ... Voir le document complet

15

Splitting Epistemic Logic Programs

Splitting Epistemic Logic Programs

... Abstract. Epistemic logic programs constitute an extension of the stable models semantics to deal with new constructs called subjective ...well-known splitting property for logic ... Voir le document complet

16

A poor man's epistemic logic based on propositional assignment and higher-order observation

A poor man's epistemic logic based on propositional assignment and higher-order observation

... our logic is in the tradition of several other logics developed in the past few ...the logic ECL-PC(PO) [12], visibility is rep- resented by a set of atoms for each agent, containing the variables the agent ... Voir le document complet

15

Epistemic boolean games based on a logic of visibility and control

Epistemic boolean games based on a logic of visibility and control

... our logic DEL-PAOC: Dynamic Epistemic Logic of Propositional Assignment, Observation and ...DEL-PAOC, epistemic and strategic operators can be re- duced to programs, leading to a sound ... Voir le document complet

8

A Succinct Language for Dynamic Epistemic Logic (long version)

A Succinct Language for Dynamic Epistemic Logic (long version)

... accessibility programs π n a is as follows: we undo the effect of the postconditions of En ; we then simulate the conjunction “w →a w 0 and e → E a e 0 ” of Definition 3 by executing the intersection of program π ... Voir le document complet

20

Epistemic boolean games based on a logic of visibility and control

Epistemic boolean games based on a logic of visibility and control

... our logic DEL-PAOC: Dynamic Epistemic Logic of Propositional Assignment, Observation and ...DEL-PAOC, epistemic and strategic operators can be re- duced to programs, leading to a sound ... Voir le document complet

9

A poor man's epistemic logic based on propositional assignment and higher-order observation

A poor man's epistemic logic based on propositional assignment and higher-order observation

... dynamic epistemic logic that is based on what an agent can observe, including joint observation and observation of what other agents ...our logic, facts of the world and their observability can both ... Voir le document complet

14

Who may say what? Thoughts about objectivity, group ability and permission in dynamic epistemic logic

Who may say what? Thoughts about objectivity, group ability and permission in dynamic epistemic logic

... Permitted announcements are true, obligatory ones also in the permissive models: P ϕ −→ ϕ and Oϕ −→ ϕ, a principle obviously false in classic deontic logic. But one has to realize the special reading of such ... Voir le document complet

216

Epistemic Equilibrium Logic

Epistemic Equilibrium Logic

... define epistemic equi- librium models by generalising the usual minimality criterion over HT models to EHT ...as epistemic equilibrium models that are maximal both under set inclusion and under a preference ... Voir le document complet

9

Epistemic Equilibrium Logic

Epistemic Equilibrium Logic

... equilibrium logic allows to characterise answer set semantics of non-epistemic logic ...here-and-there logic ( HT ) characterises their strong equiv- alence [ Lifschitz et ...two ... Voir le document complet

8

Balanced Splitting and Rebalanced Splitting

Balanced Splitting and Rebalanced Splitting

... rebalanced splitting are shown in Fig- ure 9.4(b). Rebalanced splitting is stable for substantially larger timesteps than simple splitting, but it too becomes unstable for sufficiently large ... Voir le document complet

23

From paraconsistent three-valued logics to multiple-source epistemic logic

From paraconsistent three-valued logics to multiple-source epistemic logic

... is, logic KD without modal- ity nesting and purely modal formulas, provided that  and ♦ are swapped in the ...3-valued logic, the choice be- tween the two meanings of the third truth-value (unknown and ... Voir le document complet

10

Logic and Linear programs to understand cancer response

Logic and Linear programs to understand cancer response

... of logic programs, has been introduced in order to detect the mechanisms that control cells state ...plug logic regulatory models into metabolic networks by using a gene-enzyme logical interaction ... Voir le document complet

21

From paraconsistent three-valued logics to multiple-source epistemic logic

From paraconsistent three-valued logics to multiple-source epistemic logic

... Sette logic is reputed to be a maximal logic less than propositional logic is retrospectively not mysterious, and can be seen in the modal translation at the semantic ...an epistemic ... Voir le document complet

9

Epistemic logic meets epistemic game theory: a comparison between multi-agent Kripke models and type spaces

Epistemic logic meets epistemic game theory: a comparison between multi-agent Kripke models and type spaces

... express epistemic conditions for solution concepts in game ...doxastic logic for belief and an epistemic–doxastic logic for belief and ...the epistemic–doxastic logic for belief ... Voir le document complet

33

A declarative approach to business rules in contracts : courteous logic programs in XML

A declarative approach to business rules in contracts : courteous logic programs in XML

... 4 A New Declarative Approach to Rules: Courteous Logic Programs + XML. The approach is to choose Ordinary Logic Programs (OLP)[r] ... Voir le document complet

30

An Assertion-Based Program Logic for Probabilistic Programs

An Assertion-Based Program Logic for Probabilistic Programs

... the programs presented in § 7 as well as some additional examples (such as polynomial identity test, private running sums, proper- ties about random walks, ...program logic, we enhanced the standard ... Voir le document complet

45

An Algebraic View of Space/Belief and Extrusion/Utterance for Concurrency/Epistemic Logic

An Algebraic View of Space/Belief and Extrusion/Utterance for Concurrency/Epistemic Logic

... Our scse’s can be used as constraint systems for concurrent con- straint programming (ccp) calculi. This way processes in these cal- culi would be able to express spatial mobility and epistemic/social behaviours. ... Voir le document complet

13

Learning any semantics for dynamical systems represented by logic programs

Learning any semantics for dynamical systems represented by logic programs

... semantics, logic programming semantics and some learning tech- ...inductive logic programming but require as input background knowl- ...use logic program as a meta-interpreter to explain the ... Voir le document complet

43

Computing the Least Fix-point Semantics of Definite Logic Programs Using BDDs

Computing the Least Fix-point Semantics of Definite Logic Programs Using BDDs

... Overview The first step toward this goal will be the identification of three basic operations on sets of terms, namely, union, intersection, and projection (analogous to a restriction), which allow the expression of the ... Voir le document complet

19

Show all 1242 documents...