Sciweavers

2150 search results - page 107 / 430
» On a restricted cross-intersection problem
Sort
View
ASIAN
1998
Springer
83views Algorithms» more  ASIAN 1998»
15 years 9 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...
DIS
1998
Springer
15 years 9 months ago
Learning with Globally Predictive Tests
We introduce a new bias for rule learning systems. The bias only allows a rule learner to create a rule that predicts class membership if each test of the rule in isolation is pred...
Michael J. Pazzani
ECAI
1998
Springer
15 years 9 months ago
The Complexity of Model Checking for Propositional Default Logics
Abstract. Default logic is one of the most widely used formalisms to formalize commonsense reasoning. In this paper we analyze the complexity of deciding whether a propositional in...
Paolo Liberatore, Marco Schaerf
LICS
1994
IEEE
15 years 8 months ago
Higher-Order Narrowing
Higher-order narrowing is a general method for higher-order equational reasoning and serves for instance as the foundation for the integration of functional and logic programming. ...
Christian Prehofer
AOSE
2007
Springer
15 years 8 months ago
Generation of Repair Plans for Change Propagation
Abstract. One of the most critical problems in software maintenance and evolution is propagating changes. Although many approaches have been proposed, automated change propagation ...
Khanh Hoa Dam, Michael Winikoff