Toward A Constraint-Satisfaction Framework for Evaluating Program-Understanding Algorithms

Author： Quilici A.  

Publisher： Springer Publishing Company

ISSN： 0928-8910

Source： Automated Software Engineering, Vol.4, Iss.3, 1997-07, pp. : 271-289

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Program Understanding as Constraint Satisfaction: Representation and Reasoning Techniques

By Woods S.  

Automated Software Engineering, Vol. 5, Iss. 2, 1998-04 ,pp. : 147-181

Springer Publishing Company

Access to resources Recommend Favorite

Algorithms for Distributed Constraint Satisfaction: A Review

By Yokoo M.  

Autonomous Agents and Multi-Agent Systems, Vol. 3, Iss. 2, 2000-06 ,pp. : 185-207

Springer Publishing Company

Access to resources Recommend Favorite

Dynamic algorithms for classes of constraint satisfaction problems

By Frigioni D.   Marchetti-Spaccamela A.   Nanni U.  

Theoretical Computer Science, Vol. 259, Iss. 1, 2001-05 ,pp. : 287-305

Elsevier

Access to resources Recommend Favorite

Fast Theta-Subsumption with Constraint Satisfaction Algorithms

By Maloberti Jérôme  

Machine Learning, Vol. 55, Iss. 2, 2004-05 ,pp. : 137-174

Springer Publishing Company

Access to resources Recommend Favorite

Solving Constraint-Satisfaction Problems by a Genetic Algorithm Adopting Viral Infection

By Kanoh H.   Matsumoto M.   Hasegawa K.   Kato N.   Nishihara S.  

Engineering Applications of Artificial Intelligence, Vol. 10, Iss. 6, 1997-12 ,pp. : 531-537

Elsevier

Access to resources Recommend Favorite