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 #51 to #100.

A Normal Form for Linear Temporal Equilibrium Logic: Label: en
A Decidable Constructive Description Logic: Label: en
Bridging Possibilistic Conditional Knowledge Bases and Partially Ordered Bases: Label: en
Decomposition of Distributed Nonmonotonic Multi-Context Systems: Label: en
Similarity-Based Inconsistency-Tolerant Logics: Label: en
Relax, Compensate and Then Recover: A Theory of Anytime, Approximate Inference: Label: en
Nonmonotonic Tools for Argumentation: Label: en
Extensional Semantics for Higher-Order Logic Programs with Negation: Label: en
Consistency Preservation and Crazy Formulas in BMS: Label: en
Strongly Equivalent Temporal Logic Programs: Label: en
Voting in Combinatorial Domains: What Logic and AI Have to Say: Label: en
Justification Logic: Label: en
tarfa: Tableaux and Resolution for Finite Abduction: Label: en
Automated Reasoning About Metric and Topology: Label: en
optsat: A Tool for Solving SAT Related Optimization Problems: Label: en
Representing Causal Information About a Probabilistic Process: Label: en
Towards Top-k Query Answering in Description Logics: The Case of DL-Lite: Label: en
Irrelevant Updates and Nonmonotonic Assumptions: Label: en
A Formal Analysis of KGP Agents: Label: en
Incomplete Knowledge in Hybrid Probabilistic Logic Programs: Label: en
Knowledge Base Revision in Description Logics: Label: en
Reasoning About an Agent Based on Its Revision History with Missing Inputs: Label: en
Fuzzy Answer Set Programming: Label: en
A Bottom-Up Method for the Deterministic Horn Fragment of the Description Logic $\mathcal{ALC}$: Label: en
Anti-prenexing and Prenexing for Modal Logics: Label: en
Hierarchical Argumentation: Label: en
Ambiguity Propagating Defeasible Logic and the Well-Founded Semantics: Label: en
On Herbrand’s Theorem for Intuitionistic Logic: Label: en
Introducing Attempt in a Modal Logic of Intentional Action: Label: en
Reasoning About Actions Using Description Logics with General TBoxes: Label: en
A Fault-Tolerant Default Logic: Label: en
Automatic Deductive Synthesis of Lisp Programs in the System ALISA: Label: en
Whatever You Say: Label: en
A Modularity Approach for a Fragment of $\mathcal{ALC}$: Label: en
On the Semantics of Logic Programs with Preferences: Label: en
Analytic Tableau Calculi for KLM Rational Logic R: Label: en
Deciding Extensions of the Theory of Arrays by Integrating Decision Procedures and Instantiation Strategies: Label: en
Model Representation over Finite and Infinite Signatures: Label: en
Representing Action Domains with Numeric-Valued Fluents: Label: en
Modal Logics of Negotiation and Preference: Label: en
Comparing Action Descriptions Based on Semantic Preferences: Label: en
On the Issue of Reinstatement in Argumentation: Label: en
Decidable Fragments of Logic Programming with Value Invention: Label: en
On the Logic and Computation of Partial Equilibrium Models: Label: en
A STIT-Extension of ATL: Label: en
Natural Deduction Calculus for Linear-Time Temporal Logic: Label: en
Distance-Based Repairs of Databases: Label: en
An Event-Condition-Action Logic Programming Language: Label: en
On Arbitrary Selection Strategies for Basic Superposition: Label: en
Answer Set Programming: A Declarative Approach to Solving Search Problems: Label: en