Sciweavers

96 search results - page 5 / 20
» Solving the Satisfiability Problem Using Finite Learning Aut...
Sort
View
ECAI
2010
Springer
13 years 8 months ago
Learning When to Use Lazy Learning in Constraint Solving
Abstract. Learning in the context of constraint solving is a technique by which previously unknown constraints are uncovered during search and used to speed up subsequent search. R...
Ian P. Gent, Christopher Jefferson, Lars Kotthoff,...
ENTCS
2010
136views more  ENTCS 2010»
13 years 4 months ago
A Solver for Modal Fixpoint Logics
We present MLSolver, a tool for solving the satisfiability and validity problems for modal fixpoint logics. The underlying technique is based on characterisations of satisfiabilit...
Oliver Friedmann, Martin Lange
GCC
2003
Springer
14 years 21 days ago
Some Grid Automata for Grid Computing
We use 2-Dimensional language to construct 2-Dimensional computer graphics model, use MSO or other logics to specify some graph property, and use automata model checking technique ...
Hao Shen, Yongqiang Sun
IEEECIT
2009
IEEE
14 years 2 months ago
Clustering of Software Systems Using New Hybrid Algorithms
—Software clustering is a method for increasing software system understanding and maintenance. Software designers, first use MDG graph to model the structure of software system. ...
Ali Safari Mamaghani, Mohammad Reza Meybodi
IJCAI
1989
13 years 8 months ago
Functional Representation of Designs and Redesign Problem Solving
gn problem can be abstractly characterized as a constrained function-to-structure mapping. The de­ sign task takes as input the specifications of the desired functions of a device...
Ashok K. Goel, B. Chandrasekaran