The following pages link to Logics in Artificial Intelligence (Q2835857):
Displayed 50 items.
- PTL: A Propositional Typicality Logic (Q2915063) (← links)
- The Complexity of One-Agent Refinement Modal Logic (Q2915064) (← links)
- The View-Update Problem for Indefinite Databases (Q2915065) (← links)
- Three-Valued Logics for Incomplete Information and Epistemic Logic (Q2915066) (← links)
- Exploiting Unfounded Sets for HEX-Program Evaluation (Q2915067) (← links)
- Using Satisfiability for Non-optimal Temporal Planning (Q2915070) (← links)
- How to Exploit Parametric Uniformity for Maximum Entropy Reasoning in a Relational Probabilistic Logic (Q2915071) (← links)
- Exact Query Reformulation with First-Order Ontologies and Databases (Q2915072) (← links)
- A Selective Semantics for Logic Programs with Preferences (Q2915073) (← links)
- A Minimal Model Semantics for Nonmonotonic Reasoning (Q2915074) (← links)
- Extending a Temporal Defeasible Argumentation Framework with Possibilistic Weights (Q2915075) (← links)
- On Decidability of a Logic for Order of Magnitude Qualitative Reasoning with Bidirectional Negligibility (Q2915076) (← links)
- Fault Tolerance in Belief Formation Networks (Q2915078) (← links)
- Large-Scale Cost-Based Abduction in Full-Fledged First-Order Predicate Logic with Cutting Plane Inference (Q2915079) (← links)
- Belief Base Change Operations for Answer Set Programming (Q2915080) (← links)
- A Framework for Semantic-Based Similarity Measures for $\mathcal{ELH}$ -Concepts (Q2915081) (← links)
- Sequent Systems for Lewis’ Conditional Logics (Q2915082) (← links)
- Relevant Minimal Change in Belief Update (Q2915083) (← links)
- Minimal Proof Search for Modal Logic K Model Checking (Q2915084) (← links)
- Building an Epistemic Logic for Argumentation (Q2915085) (← links)
- A Unifying Perspective on Knowledge Updates (Q2915086) (← links)
- On Satisfiability in ATL with Strategy Contexts (Q2915087) (← links)
- Jumping to Conclusions (Q2915088) (← links)
- Beyond Maxi-Consistent Argumentation Operators (Q2915089) (← links)
- Reasoning about Agent Programs Using ATL-Like Logics (Q2915090) (← links)
- Qualitative Approximate Behavior Composition (Q2915091) (← links)
- A Preferential Framework for Trivialization-Resistant Reasoning with Inconsistent Information (Q2915092) (← links)
- Query Answering over Description Logic Ontologies (Q2938480) (← links)
- Tools for the Investigation of Substructural and Paraconsistent Logics (Q2938481) (← links)
- Non-classical Planning with a Classical Planner: The Power of Transformations (Q2938482) (← links)
- The Fuzzy Description Logic $\mathsf{G}\text{-}{\mathcal{F\!L}_0} $ with Greatest Fixed-Point Semantics (Q2938484) (← links)
- Tight Complexity Bounds for Reasoning in the Description Logic $\mathcal{BE{\kern-.1em}L}$ (Q2938485) (← links)
- Relevant Closure: A New Form of Defeasible Reasoning for Description Logics (Q2938487) (← links)
- Error-Tolerant Reasoning in the Description Logic $\mathcal{E{\kern-.1em}L}$ (Q2938488) (← links)
- Sub-propositional Fragments of the Interval Temporal Logic of Allen’s Relations (Q2938489) (← links)
- SAT Modulo Graphs: Acyclicity (Q2938490) (← links)
- Enumerating Prime Implicants of Propositional Formulae in Conjunctive Normal Form (Q2938491) (← links)
- Improving the Normalization of Weight Rules in Answer Set Programs (Q2938492) (← links)
- Logical Foundations of Possibilistic Keys (Q2938493) (← links)
- Possibilistic Boolean Games: Strategic Reasoning under Incomplete Information (Q2938494) (← links)
- LEG Networks for Ranking Functions (Q2938495) (← links)
- Logics for Approximating Implication Problems of Saturated Conditional Independence (Q2938496) (← links)
- Finitary S5-Theories (Q2938497) (← links)
- Efficient Program Transformers for Translating LCC to PDL (Q2938499) (← links)
- On the Expressiveness of the Interval Logic of Allen’s Relations Over Finite and Discrete Linear Orders (Q2938500) (← links)
- Only-Knowing à la Halpern-Moses for Non-omniscient Rational Agents: A Preliminary Report (Q2938501) (← links)
- A Complexity Assessment for Queries Involving Sufficient and Necessary Causes (Q2938502) (← links)
- Inductive Learning of Answer Set Programs (Q2938503) (← links)
- Stable Models of Fuzzy Propositional Formulas (Q2938504) (← links)
- A Free Logic for Stable Models with Partial Intensional Functions (Q2938505) (← links)