382 search results - page 7 / 77 » Complexity and Expressive Power of Logic Programming |
PPDP
2010
Springer
13 years 6 months ago
2010
Springer
Permissive-Nominal Logic (PNL) is an extension of firstorder logic where term-formers can bind names in their arguments. This allows for direct axiomatisations with binders, such...
POPL
2011
ACM
12 years 10 months ago
2011
ACM
We define a new logic, STRAND, that allows reasoning with heapmanipulating programs using deductive verification and SMT solvers. STRAND logic (“STRucture ANd Data” logic) f...
VLDB
1989
ACM
13 years 11 months ago
1989
ACM
Graphical Direct Manipulation (GrDM) query languagesare characterized and positioned with respect to traditional textual query languages. After a brief survey of the current state...
POPL
2006
ACM
14 years 8 months ago
2006
ACM
Embedded code pointers (ECPs) are stored handles of functions and continuations commonly seen in low-level binaries as well as functional or higher-order programs. ECPs are known ...
LATA
2010
Springer
14 years 5 months ago
2010
Springer
Timed automata has been used as a powerful formalism for specifying, designing, and analyzing real time systems. We consider the generalization of timed automata to Pushdown Timed ...