4126 search results - page 242 / 826 » Set based logic programming |
162
Voted
COLING
1990
15 years 7 months ago
1990
This paper describes a new program, correct, which takes words rejected by the Unix spell program, proposes a list of candidate corrections, and sorts them by probability. The pro...
164
click to vote
CSL
2004
Springer
15 years 11 months ago
2004
Springer
To reason effectively about programs, it is important to have some version of a transitive-closure operator so that we can describe such notions as the set of nodes reachable from ...
152
click to vote
CSL
2007
Springer
16 years 17 days ago
2007
Springer
We study the complexity of satisfiability for DLP+ dyn , an expressive logic introduced by Demri that allows to reason about dynamic policies. DLP+ dyn extends the logic DLPdyn of...
165
click to vote
MICRO
1997
IEEE
15 years 10 months ago
1997
IEEE
Cost and power consumption are two of the most important design factors for many embedded systems, particularly consumer devices. Products such as Personal Digital Assistants, pag...
147
click to vote
SIGCSE
2009
ACM
16 years 7 months ago
2009
ACM
It is difficult for instructors of CS1 and CS2 courses to get accurate answers to such critical questions as "how long are students spending on programming assignments?"...