1776 search results - page 290 / 356 » Using a Logic Programming Language with Persistence and Cont... |
136
click to vote
SIGSOFT
2007
ACM
16 years 3 months ago
2007
ACM
Model checking techniques have traditionally dealt with temporal logic languages and automata interpreted over -words, i.e., infinite in the future but finite in the past. However...
126
click to vote
ACL
1989
15 years 4 months ago
1989
The Context-Free backbone of some natural language analyzers produces all possible CF parses as some kind of shared forest, from which a single tree is to be chosen by a disambigu...
212
click to vote
ICLP
2009
Springer
16 years 3 months ago
2009
Springer
The SLG-WAM of XSB Prolog soundly implements the Well-Founded Semantics (WFS) for logic programs, but in a few pathological cases its engine treats atoms as undefined that are true...
122
click to vote
CAV
2009
Springer
16 years 3 months ago
2009
Springer
We present HOMER, an observational-equivalence model checker for the 3rd-order fragment of Idealized Algol (IA) augmented with iteration. It works by first translating terms of the...
AIME
2005
Springer
15 years 8 months ago
2005
Springer
This paper aims at formalizing the concept of learning rules from multisource data in a cardiac monitoring context. Our method has been implemented and evaluated on learning from d...