Results 181 to 190 of about 1,599 (224)
Some of the next articles are maybe not open access.
Knowledge and Information Systems, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Juan Carlos Augusto +1 more
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Juan Carlos Augusto +1 more
openaire +2 more sources
An argumentation system for defeasible reasoning
International Journal of Approximate Reasoning, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Leila Amgoud, Farid Nouioua
exaly +4 more sources
Planning and defeasible reasoning
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems, 2007We present an argumentation-based formalism that an agent could use for constructing plans. We will analyze the interaction of arguments and actions when they are combined to construct plans using Partial Order Planning techniques.
Diego R. García +2 more
openaire +1 more source
Decision Support Systems, 1994
Abstract Numerous legal scholars have asserted that legal reasoning is largely a deductive process in which legal rules are applied to the facts of a case in order to derive a conclusion. Though some might contest this assertion, it seems that what we know as law is largely a system of rules.
Sandra K. Dewitz +2 more
openaire +2 more sources
Abstract Numerous legal scholars have asserted that legal reasoning is largely a deductive process in which legal rules are applied to the facts of a case in order to derive a conclusion. Though some might contest this assertion, it seems that what we know as law is largely a system of rules.
Sandra K. Dewitz +2 more
openaire +2 more sources
Efficient defeasible reasoning systems
Proceedings 12th IEEE Internationals Conference on Tools with Artificial Intelligence. ICTAI 2000, 2001For many years, the non-montonic reasoning community has focussed on highly expressive logics. Such logics have turned out to be computationally expensive, and have given little support to the practical use of non-monotonic reasoning. In this work we discuss defeasible logic, a less-expressive but more efficient non-monotonic logic.
Michael J. Maher +4 more
openaire +2 more sources
Cognitive Science, 1987
What philosophers call defeasible reasoning is roughly the same as nonmonotonic reasoning in AI. Some brief remarks are made about the nature of reasoning and the relationship between work in epistemology, AI, and cognitive psychology. This is followed by a general description of human rational architecture.
openaire +1 more source
What philosophers call defeasible reasoning is roughly the same as nonmonotonic reasoning in AI. Some brief remarks are made about the nature of reasoning and the relationship between work in epistemology, AI, and cognitive psychology. This is followed by a general description of human rational architecture.
openaire +1 more source
Fundamenta Informaticae, 1994
This paper combines a system of deontic logic with a system for default reasoning to analyze a notorious philosophical problem: Chisholm's Paradox. The basic approach is to write deontic rules with explicit exceptions, but we also consider the extent to which a set of implicit exceptions can be derived from the underlying deontic semantics.
openaire +2 more sources
This paper combines a system of deontic logic with a system for default reasoning to analyze a notorious philosophical problem: Chisholm's Paradox. The basic approach is to write deontic rules with explicit exceptions, but we also consider the extent to which a set of implicit exceptions can be derived from the underlying deontic semantics.
openaire +2 more sources
Artificial Intelligence, 1992
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Defeasible Reasoning via Datalog¬
Theory and Practice of Logic Programming, 2021AbstractWe address the problem of compiling defeasible theories to Datalog¬ programs. We prove the correctness of this compilation, for the defeasible logic DL(∂||), but the techniques we use apply to many other defeasible logics. Structural properties of DL(∂||) are identified that support efficient implementation and/or approximation of the ...
openaire +2 more sources
Defeasible reasoning and informal fallacies
Synthese, 2009This paper argues that some traditional fallacies should be considered as reasonable arguments when used as part of a properly conducted dialog. It is shown that argumentation schemes, formal dialog models, and profiles of dialog are useful tools for studying properties of defeasible reasoning and fallacies.
openaire +1 more source