Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
455
Defeasible Goals
- In Symbolic and Quantitative Approaches to Reasoning and Uncertainty
, 1999
"... . In this paper we study defeasible goals in Gabbay's labelled deductive systems. We prove the completeness of a simple and elegant proof theory for the labelled logic of defeasible goals by proving two phasing theorems. 1 Introduction In the usual approaches to planning in AI, a planning ..."
Abstract
-
Cited by 4 (4 self)
- Add to MetaCart
. In this paper we study defeasible goals in Gabbay's labelled deductive systems. We prove the completeness of a simple and elegant proof theory for the labelled logic of defeasible goals by proving two phasing theorems. 1 Introduction In the usual approaches to planning in AI, a planning
The Feasibility of Defeat in Defeasible Reasoning
- In Proceedings of the 1st International Conference on Knowledge Representation and Reasoning
, 1991
"... Systems of defeasible reasoning are characterized by defeasible proofs, called arguments. I claim that sensible criteria of defeat among arguments in those systems are feasible, be it to a certain extent. As defeat eventually becomes unenforceable, the only option left is to pursue both arguments co ..."
Abstract
-
Cited by 28 (3 self)
- Add to MetaCart
Systems of defeasible reasoning are characterized by defeasible proofs, called arguments. I claim that sensible criteria of defeat among arguments in those systems are feasible, be it to a certain extent. As defeat eventually becomes unenforceable, the only option left is to pursue both arguments
On the equivalence of Defeasible Deontic Logic and Temporal Defeasible Logic
"... Abstract. In this paper we formally prove that compliance results derived from temporal defeasible logic are equivalent to the ones obtained in the standard defeasible deontic logic. In order to do so we first introduce an operator allowing us to translate rules from the standard to the temporal fr ..."
Abstract
- Add to MetaCart
Abstract. In this paper we formally prove that compliance results derived from temporal defeasible logic are equivalent to the ones obtained in the standard defeasible deontic logic. In order to do so we first introduce an operator allowing us to translate rules from the standard to the temporal
Why Is Legal Reasoning Defeasible? ∗
"... Abstract. This paper analyses the claim that legal reasoning is defeasible, which is indeed a hallmark of some major contributions to the theory of legal reasoning in recent times. Before addressing the question of what kind of logical tools are needed to formalize defeasible reasoning, it must be e ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
that it would lead us to embrace either wholesale indeterminacy or ‘legal particularism’, which is criticised as an untenable form of conceiving legal justification. Finally, it is suggested that there is indeed some limited sense in which it could be said that legal reasoning is defeasible (having to do
Defeasible Logic is Stable
"... We define, and give some of the intuition behind the definition of, a nonmonotonic logic called defeasible logic. Results are proved which enable us to see how well the definition captures our intuitions. These results indicate that defeasible logic is well behaved. Section 3 considers, among other ..."
Abstract
- Add to MetaCart
We define, and give some of the intuition behind the definition of, a nonmonotonic logic called defeasible logic. Results are proved which enable us to see how well the definition captures our intuitions. These results indicate that defeasible logic is well behaved. Section 3 considers, among other
On Indeterminacy and Defeasible Reasoning
"... Some simple problems in defeasible reasoning are analyzed using both probabilistic and qualitative methods. We show that any such method which arrives at a firm conclusion regarding these problems must necessarily import additional assumptions. We argue in favor of those methods which are candid in ..."
Abstract
- Add to MetaCart
Some simple problems in defeasible reasoning are analyzed using both probabilistic and qualitative methods. We show that any such method which arrives at a firm conclusion regarding these problems must necessarily import additional assumptions. We argue in favor of those methods which are candid
Exception Handling in Workflow Systems
- Applied Intelligence
, 2000
"... In this paper, defeasible workflow is proposed as a framework to support exception handling for workflow management. By using the "justified" ECA rules to capture more contexts in workflow modeling, defeasible workflow uses context dependent reasoning to enhance the exception handling capa ..."
Abstract
-
Cited by 39 (4 self)
- Add to MetaCart
In this paper, defeasible workflow is proposed as a framework to support exception handling for workflow management. By using the "justified" ECA rules to capture more contexts in workflow modeling, defeasible workflow uses context dependent reasoning to enhance the exception handling
A recursive semantics for defeasible reasoning
- in Argumentation in Artificial Intelligence eds. I. Rahwan and G. Simari
, 2009
"... One of the most striking characteristics of human beings is their ability to function successfully in complex environments about which they know very little. In light of our pervasive ignorance, we cannot get around in the world just reasoning deductively from our prior beliefs together with new per ..."
Abstract
-
Cited by 3 (0 self)
- Add to MetaCart
perceptual input. As our conclusions are not guaranteed to be true, we must countenance the possibility that new information will lead us to change our minds, withdrawing previously adopted beliefs. In this sense, our reasoning is “defeasible”. The question arises how defeasible reasoning works, or ought
Reasoning Defeasibly About Probabilities 1
"... In concrete applications of probability, statistical investigation gives us knowledge of some probabilities, but we generally want to know many others that are not directly revealed by our data. For instance, we may know prob(P/Q) (the probability of P given Q) and prob(P/R), but what we really want ..."
Abstract
- Add to MetaCart
. These are principles telling us that although certain inferences from probabilities to probabilities are not deductively valid, nevertheless the second-order probability of their yielding correct results is 1. This makes it defeasibly reasonable to make the inferences. Thus I argue that it is defeasibly reasonable
YAWL: yet another workflow language
- Information Systems
, 2005
"... Abstract. Based on a rigorous analysis of existing workflow management systems and workflow languages, a new workflow language is proposed: YAWL (Yet Another Workflow Language). To identify the differences between the various languages, we have collected a fairly complete set of workflow patterns. B ..."
Abstract
-
Cited by 56 (2 self)
- Add to MetaCart
.g. involving multiple instances, complex synchronisations or non-local withdrawals) are not easy to map onto (high-level) Petri nets. This inspired us to develop a new language by taking Petri nets as a starting point and adding mechanisms to allow for a more direct and intuitive support of the workflow
Results 1 - 10
of
455
