519 search results - page 28 / 104 » Comparing Instance Generation Methods for Automated Reasonin... |
RTCSA
2006
IEEE
14 years 3 months ago
2006
IEEE
The modeling approach is not used to its full potential in maintenance of legacy systems. Often, models do not even exist. The main reasons being that the economic implications an...
DATE
2000
IEEE
14 years 1 months ago
2000
IEEE
The Boolean satisfiability problem (SAT) has various applications in electronic design automation (EDA) fields such as testing, timing analysis and logic verification. SAT has bee...
ACL
2008
13 years 10 months ago
2008
We present a novel framework for the discovery and representation of general semantic relationships that hold between lexical items. We propose that each such relationship can be ...
CADE
2007
Springer
14 years 9 months ago
2007
Springer
We present a method for proving rigid first order theorems by encoding them as propositional satisfiability problems. We encode the existence of a first order connection tableau an...
ASP
2005
Springer
14 years 2 months ago
2005
Springer
Despite all efforts on intelligent grounding, state-of-the-art answer set solvers still have huge memory requirements, because they compute the ground instantiation of the input pr...