• No results found

The Logics - Reasoning and Rules

Clausal reasoning for branching-time logics

Clausal reasoning for branching-time logics

... propositional logics which provides a general architecture and a high-level language which allows users to specify tableau rules and provers based on these ...of logics, for example, propositional ...

171

Reasoning with global assumptions in arithmetic modal logics

Reasoning with global assumptions in arithmetic modal logics

... for reasoning with global assumptions in coalgebraic modal ...tableau rules for the in- stance logics, so that the result applies to wider classes of ...

13

Preferential description logics: reasoning in the presence of inconsistencies

Preferential description logics: reasoning in the presence of inconsistencies

... allows rules to be added to a program between iterations and this feature can be exploited to support the introduction of new constants that represent parameters during the execution of the p-ALC ...

268

Efficient Reasoning Algorithms for Fragments of Horn Description Logics

Efficient Reasoning Algorithms for Fragments of Horn Description Logics

... R R (T )), is analogously defined. Definition 3.5.2 Let ; be some total strict order over the set of all terms such that t ; u only if dep(t) ≤ dep(u). Furthermore, we say that t is greater than u with respect to ; to ...

71

Reasoning with inconsistent possibilistic description logics ontologies with disjunctive assertions

Reasoning with inconsistent possibilistic description logics ontologies with disjunctive assertions

... the reasoning task of instance checking in such ...the reasoning framework takes this possibility into account to compute defeaters and defeaters for these defeaters to per- form a dialectical analysis to ...

7

KLMLean 2.0: A Theorem Prover for KLM Logics of Nonmonotonic Reasoning

KLMLean 2.0: A Theorem Prover for KLM Logics of Nonmonotonic Reasoning

... Gamma, then the auxiliary predicate conditionals is invoked to compute the set Γ |∼± on the resulting list NewGamma; finally, the predicate prove is recursively invoked on the only conclusion of the rule. Notice that, ...

7

Tailoring temporal description logics for reasoning over temporal conceptual models

Tailoring temporal description logics for reasoning over temporal conceptual models

... DL-Lite logics It is known from temporal logic [18] that all the temporal operators used in the previous section can be expressed in terms of the binary operators ‘since’ S and ‘until’ ...

12

2 Probabilistic and Possibilistic Reasoning with Rules

2 Probabilistic and Possibilistic Reasoning with Rules

... Various logics with support for probabilistic reasoning (purely statistical ap­ proaches as well as Bayesian reasoning) have been ...logical rules in the sense of Horn clauses (see ...

13

Polynomial-Time Probabilistic Reasoning with Partial Observations via Implicit Learning in Probability Logics

Polynomial-Time Probabilistic Reasoning with Partial Observations via Implicit Learning in Probability Logics

... expressly rules out the problems observed by O’Donnell for the applications in optimization, so the only issue is the additive error suf- fered by the ellipsoid ...

10

Efficient paraconsistent reasoning with rules and ontologies for the semantic web

Efficient paraconsistent reasoning with rules and ontologies for the semantic web

... Description Logics As discussed in the introduction in Chapter 1, even if we work under the assumption that the world itself is always consistent, inconsistencies can easily arise in knowledge bases containing ...

133

Lightweight Semantic Web Oriented Reasoning in Prolog: Tableaux Inference for Description Logics. Thomas Herchenröder

Lightweight Semantic Web Oriented Reasoning in Prolog: Tableaux Inference for Description Logics. Thomas Herchenröder

... Tableaux rules are not confluent, i.e. exhaustive applica- tion of the rules on a given node does not necessarily always lead to the same saturated tree or set of ...proof rules do not construct a ...

102

Graph-based ontology reasoning for formal verification of BREEAM rules

Graph-based ontology reasoning for formal verification of BREEAM rules

... provided reasoning tools facilitate the visualiza- tion, the enrichment and the verification of the modelled knowledge by end users ( Doumbouya, Kamsu-Foguem, Kenfack & Foguem, 2018; Kamsu-Foguem & Tiako, ...

21

Reasoning About Prescription and Description Using Prioritized Default Rules

Reasoning About Prescription and Description Using Prioritized Default Rules

... deontic logics go back to the work of Horty [32], Alchourron [1], and Nute ...defeasible reasoning using a revision operator; and Nute described a framework for defeasible reasoning over deontic ...

18

The usability of description logics: understanding the cognitive difficulties presented by description logics

The usability of description logics: understanding the cognitive difficulties presented by description logics

... human reasoning There is a considerable psychological literature on human ...human reasoning are akin to the steps executed by a logician in carrying out a ...and rules-based reasoning, ...

17

Reasoning in description logics with variables:

Reasoning in description logics with variables:

... Therefore reasoning over C can be reduced to reasoning over the correspond- ing variable automata A t C . However, despite the correspondance established by lemma 1, reduction of compliance and containment ...

12

Rational Defeasible Reasoning for Description Logics

Rational Defeasible Reasoning for Description Logics

... non-monotonic reasoning formalisms to a DL ...Description Logics (PDDL) based on an ALC-like language by introducing a version of default subsumption and proposing a semantics for ...

81

A KLM Perspective on Defeasible Reasoning for Description Logics

A KLM Perspective on Defeasible Reasoning for Description Logics

... defeasible reasoning for the description logic ...defeasible reasoning in description ...of reasoning over defeasible ontologies is no worse than that of the underlying classical ...

27

Combining Existential Rules and Description Logics

Combining Existential Rules and Description Logics

... QA is undecidable when Σ ranges over arbitrary first-order logic constraints. This motivates the search for restricted con- straint languages with decidable QA. Within the description logic community, powerful such ...

7

Rules for Plausible Reasoning

Rules for Plausible Reasoning

... But in some other sense perhaps, case 0 may not appear to be a linked argu- ment, in that it would seem to be somehow characteristic of this type of argument that the line o[r] ...

19

Geospatial Information with Description Logics, OWL, and Rules

Geospatial Information with Description Logics, OWL, and Rules

... OWL 2 property axioms for expressing inverse, symmetry, and transitivity. for spatial relations[r] ...

71

Show all 10000 documents...

Related subjects