• No results found

Possible world semantics for default logic

Logic: propositional logic semantics

Logic: propositional logic semantics

... • We should think about a knowledge base as carving out a set of models. Over time, we will add additional formulas to the knowledge base, thereby winnowing down the set of models. • Intuitively, adding a formula to the ...

44

Pubblicazione12.pdf Default semantics JP.pdf

Pubblicazione12.pdf Default semantics JP.pdf

... to default heuristics, which are prepared, instead, to deal with problems which have repeated themselves in the past and for which ‘standardized solutions’ are ...the default semantics heuristics ...

15

Rewriting Logic Semantics of Orc

Rewriting Logic Semantics of Orc

... execution semantics, in which a configuration is not allowed to advance its time unless it reaches a state where no internal or external action, other than a time tick, can be ...this semantics, an Orc ...

123

Program Semantics and Classical Logic

Program Semantics and Classical Logic

... Program Semantics and Classical Logic Reinhard Muskens Abstract In the tradition of Denotational Semantics one usually lets program constructs take their denotations in reflexive domains, ...type ...

33

A Hybrid Intuitionistic Logic: Semantics and Decidability

A Hybrid Intuitionistic Logic: Semantics and Decidability

... state. As we shall see later, the partiality of the function Eval is crucial in the proof of the finite model property. In the case Eval (w) is defined and is p, we shall say that w evaluates to p. In addition to ...

35

A general schema for generating argumentation semantics from logic programming semantics

A general schema for generating argumentation semantics from logic programming semantics

... argumentation semantics as ...the possible choices for extensions within each initial strongly connected component are determined using a basic argumentation semantics-specific function ...

39

UTexas: Natural Language Semantics using Distributional Semantics and Probabilistic Logic

UTexas: Natural Language Semantics using Distributional Semantics and Probabilistic Logic

... probabilistic logic framework we use for the RTE task (we do not use PSL here as it shares the problems of fuzzy logic with proba- bilistic ...LibSVM’s default parameters to map the two probabilities ...

6

Proof complexity of propositional default logic

Proof complexity of propositional default logic

... The semantics and the complexity of default logic have been intensively studied during the last decades ...propositional default logic: the credulous and the skeptical reasoning problem ...

17

The Complexity of Reasoning for Fragments of Default Logic

The Complexity of Reasoning for Fragments of Default Logic

... Reiter’s default logic is one of the best known and most successful formalisms to model common-sense ...reasoning. Default logic extends the usual logical (first-order or proposi- tional) ...

16

The complexity of reasoning for fragments of default logic

The complexity of reasoning for fragments of default logic

... all possible sets B of propositional connectives and study the three decision problems investigated by Gottlob when all involved formulae contain only connectives from ...

20

Proof Complexity of Propositional Default Logic

Proof Complexity of Propositional Default Logic

... classical logic is not adequate to express the flexibility of com- monsense ...Reiter’s default logic [21] is one of the most popular and widely used ...systems. Default logic extends ...

18

The complexity of reasoning for fragments of default logic

The complexity of reasoning for fragments of default logic

... all possible sets B of propositional connectives and study the three decision problems investigated by Gottlob when all involved formulae contain only connectives from ...

20

On the connection between default logic and DELP

On the connection between default logic and DELP

... Therefore, Π has to be non-contradictory, i.e. no pair of contradictory literals can be derived from Π. Given a literal L the complement with respect to strong negation will be denoted L (i.e. a = ¬ a and ¬ a = a). D E ...

12

Kripke Semantics and Proof Systems for Combining Intuitionistic Logic and Classical Logic

Kripke Semantics and Proof Systems for Combining Intuitionistic Logic and Classical Logic

... linear logic is that it generalizes the principles of Gentzen in terms of the conditions under which cut-elimination is ...The semantics of linear logic emphasize the interpretation of proofs as ...

34

Extension-based argumentation semantics via logic programming semantics with negation as failure

Extension-based argumentation semantics via logic programming semantics with negation as failure

... argumentation semantics in one single logic program and three different logic programming ...argumentation semantics in terms of solvers of logic programming semantics ...

15

Possible worlds semantics and true-true counterfactuals

Possible worlds semantics and true-true counterfactuals

... McGlynn’s semantics, however, this is not the case: when an antecedent, A, is true, it plays a further role, partly determining which worlds are relevant to determining the conditional’s ...antecedent-relative ...

36

Safety, the Preface Paradox and Possible Worlds Semantics

Safety, the Preface Paradox and Possible Worlds Semantics

... to possible worlds semantics and thus might render them graspable in a way that would pre- serve SKN and ...treat world descriptions as maximal, or complete, and one might intuitively suppose that ...

17

MoL 2009 18: 
  Inquisitive Semantics and Logic

MoL 2009 18: Inquisitive Semantics and Logic

... convenient semantics I have remarked on more than occasion in this text that the update semantics defined here is perfectly static, as there are no real dynamic ...inquisitive semantics in terms of ...

50

Bi-approximation Semantics for Substructural Logic at Work

Bi-approximation Semantics for Substructural Logic at Work

... consequences as relations between premises and conclusions. On p-frames, we think about X as a set of premise worlds where we evaluate only premises, and about Y as a set of conclusion worlds where we evaluate just ...

23

A Formalization of the Semantics of Functional-Logic Programming in Isabelle

A Formalization of the Semantics of Functional-Logic Programming in Isabelle

... choice semantics. A standard formulation for this semantics is the CRWL logic, that specifies a proof calculus for computing the set of possible results for each ...

11

Show all 10000 documents...

Related subjects