4513 search results - page 597 / 903 » Logic programming with satisfiability |
129
click to vote
CSL
2006
Springer
15 years 8 months ago
2006
Springer
Game quantification is an expressive concept and has been studied in model theory and descriptive set theory, especially in relation to infinitary logics. Automatic structures on t...
162
click to vote
FOIKS
2006
Springer
15 years 8 months ago
2006
Springer
It is claimed in [45] that first-order theorem provers are not efficient for reasoning with ontologies based on description logics compared to specialised description logic reasone...
154
click to vote
CCS
2011
ACM
14 years 4 months ago
2011
ACM
We present the design, implementation and evaluation of an algorithm that checks audit logs for compliance with privacy and security policies. The algorithm, which we name reduce,...
152
click to vote
PPDP
2005
Springer
15 years 10 months ago
2005
Springer
We present ReactiveML, a programming language dedicated to the implementation of complex reactive systems as found in graphical user interfaces, video games or simulation problems...
138
click to vote
ESOP
2004
Springer
15 years 9 months ago
2004
Springer
t) Peter W. O’Hearn Queen Mary, University of London In the 1960s Dijkstra suggested that, in order to limit the complexity of potential process interactions, concurrent programs...