851 search results - page 91 / 171 » Inaccessibility in Decision Procedures |
RTA
2010
Springer
14 years 27 days ago
2010
Springer
Infinitary Term Rewriting allows to express infinitary terms and infinitary reductions that converge to them. As their notion of transfinite reduction in general, and as binary...
GECCO
2006
Springer
14 years 20 days ago
2006
Springer
This paper introduces a new design methodology (we call it "innovization") in the context of finding new and innovative design principles by means of optimization techni...
ECAI
2006
Springer
13 years 11 months ago
2006
Springer
Propositional satisfiability (SAT) is a success story in Computer Science and Artificial Intelligence: SAT solvers are currently used to solve problems in many different applicati...
DIALM
2005
ACM
13 years 11 months ago
2005
ACM
The identification of holes in a wireless sensor network is of primary interest since the breakdown of sensor nodes in a larger area often indicates one of the special events to ...
AAAI
2004
13 years 10 months ago
2004
The relation between answer set programming (ASP) and propositional satisfiability (SAT) is at the center of many research papers, partly because of the tremendous performance boo...