Corpus ID: 37645051

Handbook of Logic in Artificial Intelligence and Logic Programming, Volume2, Deduction Methodologies

  title={Handbook of Logic in Artificial Intelligence and Logic Programming, Volume2, Deduction Methodologies},
  author={D. Loveland and G. Nadathur and A. and C. Kakas and R. Kowalski and F. Toni},
  booktitle={Handbook of Logic in Artificial Intelligence and Logic Programming, Volume 2},
Multiple agent possibilistic logic
The proposed setting enables us to distinguish between the global consistency of a set of agents and their individual consistency (where both can be a matter of degree). Expand
Defeasible Inheritance Networks and Linear Logic: Horn Fragments and Proof Nets
Based on a remark of Girard (1992) and a formalization given by Fouquer� e and Vauzeilles (1994), we investigate a formalization of defeasible inheritance reasoning in terms of linear logic. We showExpand
Operators and Laws for Combining Preference Relations
It is shown that the lexicographic rule is the only way of combining preference relations which satisfies natural conditions (similar to those proposed by Arrow), and a complete equational axiomatization of this form of generalized prioritization is given. Expand
Learning, Probability and Logic: Toward a Unified Approach for Content-Based Music Information Retrieval
This perspective paper critically looks at the problem of automatic chord estimation from audio recordings as a case study of content-based algorithms, and advocates that the identified hurdles of current approaches could be overcome by recent developments in the area of Statistical Relational Artificial Intelligence (StarAI) that unifies probability, logic and (deep) learning. Expand
VMCAI Evaluation Artifact VMCAI Evaluation Artifact Functional How to Win First-Order Safety Games ?
First-order (FO) transition systems have recently attracted attention for the verification of parametric systems such as network protocols, software-defined networks or multi-agent workflows likeExpand
Learning Sequence Encoders for Temporal Knowledge Graph Completion
This work utilizes recurrent neural networks to learn time-aware representations of relation types which can be used in conjunction with existing latent factorization methods to incorporate temporal information. Expand
Automated multi-level governance compliance checking
A formal framework with a novel semantics that defines compliance between concrete lower level institutions and abstract higher level institutions is proposed and complemented by a sound and complete computational framework that automates compliance checking. Expand
On the relation between possibilistic logic and modal logics of belief and knowledge
This paper compares the relational semantics of epistemic logics with simpler possibilistic semantics of a fragment of such logics that only uses modal formulas of depth 1, and presents extensions of generalized possibillistic logic with objective and non-nested multimodal formulas, in the style of modal logics KD45 and S5. Expand
Paraconsistent OWL and related logics
Four-valued paraconsistent description logics which can reason over inconsistencies are presented and the general framework described here has the distinct advantage of allowing classical reasoners to draw sound but nontrivial conclusions from even inconsistent knowledge bases. Expand
Semantics for the Semantic Web: The Implicit, the Formal and the Powerful
The central message of this article is that building the Semantic Web purely on description logics will artificially limit its potential, and that it will need to both exploit well-known techniques that support implicit semantics, and develop more powerful semantic techniques. Expand