1083 search results - page 202 / 217 » Using Contextual Logic Programming for Temporal Reasoning |
149
click to vote
PEPM
2010
ACM
15 years 3 months ago
2010
ACM
Software engineering, automated reasoning, rule-based programming or specifications often use rewriting systems for which termination, among other properties, may have to be ensur...
121
click to vote
AI
2007
Springer
15 years 1 months ago
2007
Springer
It is not surprising that reaching human-level AI has proved to be difficult and progress has been slow— though there has been important progress. The slowness and the demand t...
120
click to vote
CADE
2007
Springer
16 years 2 months ago
2007
Springer
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BA...
135
click to vote
KBSE
2005
IEEE
15 years 7 months ago
2005
IEEE
Current formal software engineering methodologies provide a vast array of languages for specifying correctness properties, as well as a wide assortment automated tools that aid in...
108
click to vote
CODES
2007
IEEE
15 years 8 months ago
2007
IEEE
There is a strong need now for compilers of embedded systems to find effective ways of optimizing series of loop-nests, wherein majority of the memory references occur in the fo...