… the problem, the selection of the relaxed constraints … Constraint Solver that we have been
developing to solve a hierarchy of constraints, ie, a constraint network where each constraint is …

… This paper presents a defeasible constraint solver for the do… of the solver into an Incremental
Hierarchical Constraint Solver (… for the unsatisfiabflity of a set of constraints, and c) the ability …

… must instead be done defeasibly, making the default … defeasible reasoner. The resulting
planner performs essentially the same search as UCPOP, but does it by reasoning defeasibly …

… This paper extends a constraint solver over the booleans to make it defeasible, and …
architecture for defeasible constraint solving. This complements previous work on defeasible solvers …

… The idea is to transform the default rules independently of any context into a set of non-defeasible
rules. The idea is to generate automatically from D a set of non-defeasible rules D in …

… In this paper we will analyse the issue of defeasibility in the … We will adopt a very general
idea of legal defeasibility, in which … defeasibility, process-based defeasibility, and theory-based …

… Much of our reasoning is defeasible in this way. Since around 1980, considerable research
in AI has focused on how to model reasoning of this sort. In this paper, I describe one …

… A consequence of this constraint is that we must always keep track of the support set of lines
in our proofs. In some lines of an SDL proof, we can appeal to all the literals in the theory; in …

This article surveys existing practical implementations of both defeasible and argumentation-based
reasoning engines and associated literature. We aim to summarize the current state …

We present a parser for German that achieves a competitive accuracy on unrestricted input
while maintaining a coverage of 100%. By writing well-formedness rules as declarative, …