Sciweavers

2181 search results - page 119 / 437
» The restriction scaffold problem
Sort
View
ECAI
1998
Springer
14 years 3 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
14 years 3 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
14 years 3 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
EUROCAST
2009
Springer
116views Hardware» more  EUROCAST 2009»
14 years 3 months ago
Complete Sets of Hamiltonian Circuits for Classification of Documents
The calculation of Hamiltonian Circuits is an NP-complete task. This paper uses slightly modified complete sets of Hamiltonian circuits for the classification of documents. The sol...
Bernd Steinbach, Christian Posthoff
RTA
2000
Springer
14 years 2 months ago
Linear Second-Order Unification and Context Unification with Tree-Regular Constraints
Linear Second-Order Unification and Context Unification are closely related problems. However, their equivalence was never formally proved. Context unification is a restriction of ...
Jordi Levy, Mateu Villaret