Paraconsistent logic

About: Paraconsistent logic is a research topic. Over the lifetime, 1610 publications have been published within this topic receiving 28842 citations.

Logics in artificial intelligence : 8th European Conference, JELIA 2002, Cosenza, Italy, September 23-26, 2002 : proceedings

Abstract: Multi-agent Systems- A Logic Programming Language for Multi-agent Systems- A Proof-System for the Safe Execution of Tasks in Multi-agent Systems- An Argumentation Framework for Merging Conflicting Knowledge Bases- Multi-agent Logics of Dynamic Belief and Knowledge- Evolution and Changes- Evolving Logic Programs- A Compilation of Updates plus Preferences- Description Logic and Semantic Web- Towards Service Description Logics- P- (D): A Probabilistic Extension of (D) for Probabilistic Ontologies in the Semantic Web- A Temporal Description Logic for Reasoning over Conceptual Schemas and Queries- Complexity Issues- Polynomial-Length Planning Spans the Polynomial Hierarchy- Complexity of Multi-agent Systems Behavior- Complexity and Algorithms for the Matching of Bag and Set Terms- Probabilistic Logic- Non-commutativity and Expressive Deductive Logic Databases- Using Institutions for the Study of Qualitative and Quantitative Conditional Logics- Planning- Theoretical and Empirical Aspects of a Planner in a Multi-agent Environment- Answer Set Planning under Action Costs- Modal Logic and Causal Reasoning- On Fibring Semantics for BDI Logics- A Modal Formulation of McCain and Turner's Theory of Causal Reasoning- Second-Order Quantifier Elimination in Modal Contexts- Theory- Interpolation Theorems for Nonmonotonic Reasoning Systems- Minimal Answer Computation and SOL- Decidability of Interval Temporal Logics over Split-Frames via Granularity- Reasoning under Uncertainty- Uncertainty and Partial Non-uniform Assumptions in Parametric Deductive Databases- A Qualitative Reasoning with Nuanced Information- Satisfiability- Dependent and Independent Variables in Propositional Satisfiability- A DPLL-Based Calculus for Ground Satisfiability Modulo Theories- Paraconsistent Reasoning- Paraconsistent Reasoning via Quantified Boolean Formulas, I: Axiomatising Signed Systems- Three-Valued Logics for Inconsistency Handling- Paraconsistent Logic Programs- Actions and Causation- Interpolation Properties of Action Logic: Lazy-Formalization to the Frame Problem- Reasoning about Actions in Prioritized Default Theory- Towards a Conditional Logic of Actions and Causation- Logics for Agents- Axiomatising Nash-Consistent Coalition Logic- Representing Possibilities in Relation to Constraints and Agents- An Abductive Logic Programming Architecture for Negotiating Agents- Semantics- Preferred Answer Sets for Ordered Logic Programs- Implementing Ordered Disjunction Using Answer Set Solvers for Normal Programs- An Infinite-Valued Semantics for Logic Programs with Negation- Optimization Issues in Answer Set Semantics- More on noMoRe- Answer Set Programming by Ant Colony Optimization- Testing the Equivalence of Logic Programs under Stable Model Semantics- System Session- Argumentative Reasoning with ABEL- COBA: A Consistency-Based Belief Revision System- Constraint Lingo: A Program for Solving Logic Puzzles and Other Tabular Constraint Problems- : Integrating Data Mining with Intelligent Query Answering- NoMoRe: Non-monotonic Reasoning with Logic Programs- Process Miner - A Tool for Mining Process Schemes from Event-Based Data- SMILES: A Multi-purpose Learning System- The aspps System- The DLV System- The DLVK Planning System: Progress Report- Z-log: Applying System-Z- Invited Talks- Hypergraph Transversal Computation and Related Problems in Logic and AI- Alternation- The USA-Advisor: A Case Study in Answer Set Programming

A decompositional deduction system for a logic featuring inconsistency and uncertainty

Abstract: The paper discusses a four-valued propositional logic FOUR≤, similar to Belnap's logic, which can be used to describe incomplete or inconsistent knowledge. In addition to the two classical logical ...

Semantic Entailment in Non Classical Logics Based on Proofs Found in Classical Logic

Abstract: A particular way of relating logics, specially useful in the framework of automated theorem proving is proposed From the definition of the semantics of a logic (called source logic and abbreviated henceforth SL) in another logic (called target logic and abbreviated henceforth TL or TLS), we translate formulas of SL into TL using known techniques Then we show how to partially translate proofs found in TL into SL More precisely, the main theoretical result of the paper is a theorem establishing that for a class of non-classical logics — taking first-order sorted logic with equality as target logic — given a formula f in SL, it is possible from a proof P of f (obtained in TL) to backward translate into SL some (sometimes all) formulas in P This set of backward translated formulas are proved to be semantically related each other and to define a partial consequence relation in SL We get therefore an entailment sequence for f in SL Our approach is applicable to source logics either without “computationally interesting” proof systems or without proof systems at all One running example is fully treated We compare the results of our method with the ones of a specialized tableaux-based theorem prover for the logic S4(p) Some hints of future work are given

Semantica G3 '-Estable e Inconsistencia

Abstract: WE PRESENT AN OVERVIEW ON HOW TO PERFORM NON-MONOTONIC REASONING BASED ON PARACONSISTENT LOGICS. IN PARTICULAR, WE SHOW THAT ONE CAN DEFINE A LOGIC PROGRAMMING SEMANTICS BASED ON THE PARACONSISTENT LOGIC G€™3 WHICH IS CALLED G€™3-STABLE SEMANTICS. THIS SEMANTICS DEFINES A FRAME FOR PERFORMING NON-MONOTONIC REASONING IN DOMAINS WHICH ARE PERVADED WITH VAGUENESS AND INCONSISTENCIES. IN FACT, WE SHOW THAT, BY CONSIDERING ALSO A POSSIBILISTIC LOGIC POINT OF VIEW, ONE CAN USE THIS EXTENDED FRAMEWORK FOR DEFINING A POSSIBILISTIC LOGIC PROGRAMMING APPROACH ABLE TO DEAL WITH REASONING, WHICH IS AT THE SAME TIME NON-MONOTONIC AND UNCERTAIN.