1094 search results - page 123 / 219 » On Computing Explanations in Argumentation |
79
Voted
ICALP
2005
Springer
15 years 4 months ago
2005
Springer
Abstract. We study the use of the elaboration preorder (due to ArunKumar and Natarajan) in the framework of up-to techniques for weak bisimulation. We show that elaboration yields ...
IPTPS
2005
Springer
15 years 4 months ago
2005
Springer
In this paper, we present Chainsaw, a p2p overlay multicast system that completely eliminates trees. Peers are notified of new packets by their neighbors and must explicitly requ...
ICCSA
2004
Springer
15 years 4 months ago
2004
Springer
Abstract. This paper presents the Job Shop Scheduling Problem (JSSP) represented as the well known Satisfiabilty Problem (SAT). Even though the representation of JSSP in SAT is not...
IWPC
2003
IEEE
15 years 4 months ago
2003
IEEE
When computing program slices on all variables in a system, we observed that many of these slices are the same. This leads to the question: Are we looking at software clones? We d...
IMR
2003
Springer
15 years 4 months ago
2003
Springer
An “adaptive” variant of Ruppert’s Algorithm for producing quality triangular planar meshes is introduced. The algorithm terminates for arbitrary Planar Straight Line Graph ...