Entity usage

This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.

Showing below up to 50 results in range #101 to #150.

From Inductive Logic Programming to Relational Data Mining: Label: en
Rule Calculus: Semantics, Axioms and Applications: Label: en
Meta Level Reasoning and Default Reasoning: Label: en
Literal Projection for First-Order Logic: Label: en
Improved Second-Order Quantifier Elimination in Modal Logic: Label: en
Cheap Boolean Role Constructors for Description Logics: Label: en
Combining Modes of Reasoning: An Application of Abstract Argumentation: Label: en
How to Restore Compactness into Probabilistic Logics?: Label: en
Extending Carin to the Description Logics of the $\mathcal{SH}$ Family: Label: en
A Proof-Theoretic Approach to Deciding Subsumption and Computing Least Common Subsumer in $\cal EL$ w.r.t. Hybrid TBoxes: Label: en
A Tableau for RoBCTL: Label: en
A Game-Theoretic Measure of Argument Strength for Abstract Argumentation: Label: en
Confluence Operators: Label: en
Fibrational Semantics for Many-Valued Logic Programs: Grounds for Non-Groundness: Label: en
Linear Exponentials as Resource Operators: A Decidable First-order Linear Logic with Bounded Exponentials: Label: en
GOAL Agents Instantiate Intention Logic: Label: en
Uniform Interpolation by Resolution in Modal Logic: Label: en
Counting Complexity of Minimal Cardinality and Minimal Weight Abduction: Label: en
Reasoning about Typicality in Preferential Description Logics: Label: en
Accommodative Belief Revision: Label: en
Query Answering in the Description Logic Horn- $\mathcal{SHIQ}$: Label: en
Computational Complexity of Semi-stable Semantics in Abstract Argumentation Frameworks: Label: en
A Fluent Calculus Semantics for ADL with Plan Constraints: Label: en
On the Credal Structure of Consistent Probabilities: Label: en
Recovering Consistency by Forgetting Inconsistency: Label: en
Declarative Semantics for Revision Programming and Connections to Active Integrity Constraints: Label: en
A Logic for Closed-World Interaction: Label: en
Normal Form Nested Programs: Label: en
Optimal Tableaux for Right Propositional Neighborhood Logic over Linear Orders: Label: en
Complexity and Succinctness Issues for Linear-Time Hybrid Logics: Label: en
Propositional Clausal Defeasible Logic: Label: en
On the Expressiveness of the Interval Logic of Allen’s Relations Over Finite and Discrete Linear Orders: Label: en
Efficient Program Transformers for Translating LCC to PDL: Label: en
Finitary S5-Theories: Label: en
Logics for Approximating Implication Problems of Saturated Conditional Independence: Label: en
LEG Networks for Ranking Functions: Label: en
Possibilistic Boolean Games: Strategic Reasoning under Incomplete Information: Label: en
Logical Foundations of Possibilistic Keys: Label: en
Improving the Normalization of Weight Rules in Answer Set Programs: Label: en
Enumerating Prime Implicants of Propositional Formulae in Conjunctive Normal Form: Label: en
SAT Modulo Graphs: Acyclicity: Label: en
Sub-propositional Fragments of the Interval Temporal Logic of Allen’s Relations: Label: en
Error-Tolerant Reasoning in the Description Logic $\mathcal{E{\kern-.1em}L}$: Label: en
Relevant Closure: A New Form of Defeasible Reasoning for Description Logics: Label: en
Tight Complexity Bounds for Reasoning in the Description Logic $\mathcal{BE{\kern-.1em}L}$: Label: en
The Fuzzy Description Logic $\mathsf{G}\text{-}{\mathcal{F\!L}_0} $ with Greatest Fixed-Point Semantics: Label: en
Non-classical Planning with a Classical Planner: The Power of Transformations: Label: en
Tools for the Investigation of Substructural and Paraconsistent Logics: Label: en
Query Answering over Description Logic Ontologies: Label: en
Revisiting Reductants in the Multi-adjoint Logic Programming Framework: Label: en