Sciweavers

181 search results - page 21 / 37
» New Inference Rules for Max-SAT
Sort
View
TIME
2009
IEEE
14 years 2 months ago
Fixing the Semantics for Dynamic Controllability and Providing a More Practical Characterization of Dynamic Execution Strategies
Morris, Muscettola and Vidal (MMV) presented an algorithm for checking the dynamic controllability (DC) of temporal networks in which certain temporal durations are beyond the con...
Luke Hunsberger
ASIAN
1998
Springer
83views Algorithms» more  ASIAN 1998»
13 years 12 months ago
Rigid Reachability
We show that rigid reachability, the non-symmetric form of rigid E-unification, is undecidable already in the case of a single constraint. From this we infer the undecidability of ...
Harald Ganzinger, Florent Jacquemard, Margus Veane...
IJCAI
1989
13 years 9 months ago
Detecting and Correcting Errors of Omission After Explanation-Based Learning
In this paper, we address an issue that arises when the background knowledge used by explanationbased learning is incorrect. In particular, we consider the problems that can be ca...
Michael J. Pazzani
ISCIS
2004
Springer
14 years 1 months ago
System BV without the Equalities for Unit
System BV is an extension of multiplicative linear logic with a non-commutative self-dual operator. In this paper we present systems equivalent to system BV where equalities for un...
Ozan Kahramanogullari
ECML
1991
Springer
13 years 11 months ago
A Multistrategy Learning Approach to Domain Modeling and Knowledge Acquisition
This paper presents an approach to domain modeling and knowledge acquisition that consists of a gradual and goal-driven improvement of an incomplete domain model provided by a hum...
Gheorghe Tecuci