634 search results - page 12 / 127 » Completion Procedures as Semidecision Procedures |
IJCAI
1997
13 years 9 months ago
1997
When dealing with narrative texts, a system must possess a strong domain theory, and especially knowledge about situations occurring in the world. Otherwise the system must envisa...
ASE
2005
13 years 8 months ago
2005
Deductive program synthesis systems based on automated theorem proving offer the promise of software that is correct by construction. However, the difficulty encountered in constru...
RTA
2010
Springer
14 years 9 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...
CAV
2000
Springer
14 years 21 hour ago
2000
Springer
In this paper we show how to do symbolic model checking using Boolean Expression Diagrams (BEDs), a non-canonical representation for Boolean formulas, instead of Binary Decision Di...
CGA
2005
13 years 8 months ago
2005
Procedural encoding of scattered and unstructured scalar datasets using Radial Basis Functions (RBF) is an active area of research with great potential for compactly representing ...