3047 search results - page 396 / 610 » On the Meaning of Logical Completeness |
TASE
2008
IEEE
14 years 10 months ago
2008
IEEE
This paper considers a matrix-based discrete event control approach for a warehouse. The control system is organized in two modules: a dynamic model and a controller. The model pro...
111
click to vote
DLOG
2011
14 years 2 months ago
2011
Query answering in Ontology Based Data Access (OBDA) exploits the knowledge of an ontology’s TBox to deal with incompleteness of the ABox (or data source). Current query-answerin...
107
click to vote
SIGSOFT
2007
ACM
15 years 11 months ago
2007
ACM
Automated verification is a technique for establishing if certain properties, usually expressed in temporal logic, hold for a system model. The model can be defined using a high-l...
113
click to vote
SIGSOFT
2007
ACM
15 years 11 months ago
2007
ACM
We present an approach for checking code against rich specifications, based on existing work that consists of encoding the program in a relational logic and using a constraint sol...
174
click to vote
ICFP
2009
ACM
15 years 11 months ago
2009
ACM
We present a new approach for constructing and verifying higherorder, imperative programs using the Coq proof assistant. We build on the past work on the Ynot system, which is bas...