Results 11 to 20 of about 52,814 (199)
Complexity of Non-Monotonic Logics [PDF]
, 2010 Over the past few decades, non-monotonic reasoning has developed to be one of the most important topics in computational logic and artificial intelligence. Different ways to introduce non-monotonic aspects to classical logic have been considered, e.g., extension with default rules, extension with modal belief operators, or modification of the semantics.
Thomas, Michael, Vollmer, Heribert
core +6 more sources
Semantic Matchmaking as Non-Monotonic Reasoning: A Description Logic Approach
Journal of Artificial Intelligence Research, 2007 Matchmaking arises when supply and demand meet in an electronic marketplace, or when agents search for a web service to perform some task, or even when recruiting agencies match curricula and job profiles. In such open environments, the objective of a matchmaking process is to discover best available offers to a given request.
Di Noia,T. +2 more
core +9 more sources
Game Semantics for Non-monotonic Intensional Logic Programming
Annals of Pure and Applied Logic, 2013 Abstract Intensional logic programming is an extension of logic programming based on intensional logic, which includes as special cases both temporal and modal logic programming. In [13] , M. Orgun and W.W. Wadge provided a general framework for capturing the semantics of intensional logic programming languages.
Galanaki, C. +2 more
openaire +4 more sources
Reasoning Biases, Non‐Monotonic Logics and Belief Revision [PDF]
Theoria, 2016 A range of formal models of human reasoning have been proposed in a number of fields such as philosophy, logic, artificial intelligence, computer science, psychology, cognitive science, etc.: various logics (epistemic logics; non‐monotonic logics), probabilistic systems (most notably, but not exclusively, Bayesian probability theory), belief revision ...
Catarina Dutilh Novaes +1 more
openaire +3 more sources
An Environment for the Exploration of Non Monotonic Logic Programs
, 2001 Stable Model Semantics and Well Founded Semantics have been shown to be very useful in several applications of non-monotonic reasoning. However, Stable Models presents a high computational complexity, whereas Well Founded Semantics is easy to compute and provides an approximation of Stable Models.
Castro, Luis F., Warren, David S.
openaire +4 more sources
Autonomous Aerial Vehicle - Based on Non-Monotonic Logic
Proceedings of the 3rd International Conference on Vehicle Technology and Intelligent Transport Systems, 2017 In this article we study the case of an autonomous motor-glider. The aims of the aircraft is to maintain its flight as long as possible, taking advantage of the rising air from the ground, known as thermals, despite of limited energy resources and possible external influences, such as turbulences. The pilot task being to make decisions with incomplete,
Medina, Vilchis +2 more
openaire +3 more sources
Redundancy in logic III: Non-monotonic reasoning [PDF]
Artificial Intelligence, 2008 Results about the redundancy of circumscriptive and default theories are presented. In particular, the complexity of establishing whether a given theory is redundant is establihsed.
Paolo Liberatore
openaire +6 more sources
A non-monotonic Description Logic for reasoning about typicality
Artificial Intelligence, 2013 AbstractIn this paper we propose a non-monotonic extension of the Description Logic ALC for reasoning about prototypical properties and inheritance with exceptions. The resulting logic, called ALC+Tmin, is built upon a previously introduced (monotonic) logic ALC+T that is obtained by adding a typicality operator T to ALC.
L. Giordano +3 more
openaire +6 more sources
Handling and measuring inconsistency in non-monotonic logics
Artificial Intelligence, 2020 Abstract We address the issue of quantitatively assessing the severity of inconsistencies in non-monotonic frameworks. While measuring inconsistency in classical logics has been investigated for some time now, taking the non-monotonicity into account poses new challenges.
Matthias Thimm +2 more
openaire +3 more sources
Belief Revision in Non-Monotonic Reasoning and Logic Programming
Fundamenta Informaticae, 1996 Summary: In order to be able to explicitly reason about beliefs, we've introduced a non-monotonic formalism, called the Autoepistemic Logic of Beliefs, AEB, obtained by augmenting classical propositional logic with a belief operator, \(B\). For this language we've defined the static autoepistemic expansions semantics.
José Júlio Alferes +2 more
openaire +5 more sources