177 search results - page 18 / 36 » Logical complexity of graphs: a survey |
ATVA
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Bounded model checking (BMC) is a technique for overcoming the state explosion problem which has gained wide industrial acceptance. Bounded model checking is typically ap...
PODS
2009
ACM
14 years 8 months ago
2009
ACM
For many years, finite model theory was viewed as the backbone of database theory, and database theory in turn supplied finite model theory with key motivations and problems. By n...
DAGSTUHL
1998
13 years 9 months ago
1998
Abstract. During the last years, a number of formal specification languages for knowledge-based systems have been developed. Characteristic for knowledge-based systems are a comple...
CORR
1999
Springer
13 years 7 months ago
1999
Springer
In recent work we have presented a formal framework for linguistic annotation based on labeled acyclic digraphs. These `annotation graphs' oer a simple yet powerful method fo...
AMAST
2008
Springer
13 years 9 months ago
2008
Springer
Many complex analysis problems can be most clearly and easily specified as logic rules and queries, where rules specify how given facts can be combined to infer new facts, and quer...