1368 search results - page 57 / 274 » Personality-Based Practical Reasoning |
131
click to vote
DLOG
2011
14 years 5 months ago
2011
We show that deciding conjunctive query inseparability for OWL 2 QL ontologies is PSpace-hard and in ExpTime. We give polynomial-time (incomplete) algorithms and demonstrate by exp...
112
Voted
ACE
2003
15 years 3 months ago
2003
There is a large body of research that indicates the practice of cheating amongst students in the tertiary sector is widespread. Various studies have also attempted to determine r...
VMCAI
2010
Springer
15 years 11 months ago
2010
Springer
We present an automatic verification procedure based on RGSep that is suitable for reasoning about fine-grained concurrent heapmanipulating programs. The procedure computes a set o...
119
click to vote
TPHOL
2007
IEEE
15 years 8 months ago
2007
IEEE
We present a simple method to formally prove termination of recursive functions by searching for lexicographic combinations of size measures. Despite its simplicity, the method tur...
109
click to vote
ECBS
2003
IEEE
15 years 7 months ago
2003
IEEE
This paper presents a practical approach to architecture-based design of computer based systems. The approach is discussed in relation to other existing of performing discovery, a...