6608 search results - page 1114 / 1322 » On the Completeness of Model Checking |
147
click to vote
DLOG
2004
15 years 6 months ago
2004
er reports on a pragmatic query language for Racer. The abstract syntax and semantics of this query language is defined. Next, the practical relevance of this query language is sh...
170
click to vote
AAAI
1994
15 years 6 months ago
1994
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
149
click to vote
CSL
2010
Springer
15 years 5 months ago
2010
Springer
Deduction modulo consists in presenting a theory through rewrite rules to support automatic and interactive proof search. It induces proof search methods based on narrowing, such a...
143
click to vote
BMCBI
2010
15 years 4 months ago
2010
Background: S. cerevisiae, A. thaliana and M. musculus are well-studied organisms in biology and the sequencing of their genomes was completed many years ago. It is still a challe...
135
click to vote
FUIN
2007
15 years 4 months ago
2007
Abstract. Our previous research presents a methodology of cooperative problem solving for beliefdesire-intention (BDI) systems, based on a complete formal theory called TEAMLOG. Th...