1391 search results - page 209 / 279 » Completeness of Neighbourhood Logic |
160
click to vote
EKAW
2004
Springer
15 years 11 months ago
2004
Springer
Motivated by the need to extend features of semantic matchmaking between request and offer descriptions, a model is presented that exploits recently proposed non-standard inference...
167
click to vote
LOPSTR
2004
Springer
15 years 11 months ago
2004
Springer
We address the problem of an efficient rewriting strategy for general term rewriting systems. Several strategies have been proposed over the last two decades for rewriting, the mos...
158
click to vote
ISCAS
2003
IEEE
15 years 11 months ago
2003
IEEE
To handle today’s complexity, modern circuits and systems be specified at a high level of abstraction. Recently, SystemC has been proposed as a language that allows a fast on o...
156
click to vote
LICS
2003
IEEE
15 years 11 months ago
2003
IEEE
We consider instantiation-based theorem proving whereby instances of clauses are generated by certain inferences, and where inconsistency is detected by propositional tests. We gi...
180
click to vote
IDEAS
2002
IEEE
15 years 11 months ago
2002
IEEE
Boolean expression simplification is a well-known problem in the history of Computer Science. The problem of determining prime implicates from an arbitrary Boolean expression has...