Sciweavers

1711 search results - page 37 / 343
» Completing pseudojump operators
Sort
View
ICLP
2009
Springer
16 years 6 months ago
Logic Programs under Three-Valued Lukasiewicz Semantics
If logic programs are interpreted over a three-valued logic, then often Kleene's strong three-valued logic with complete equivalence and Fitting's associated immediate co...
Carroline Dewi Puspa Kencana Ramli, Steffen Hö...
EDBT
1998
ACM
155views Database» more  EDBT 1998»
15 years 9 months ago
Improving the Query Performance of High-Dimensional Index Structures by Bulk-Load Operations
Abstract. In this paper, we propose a new bulk-loading technique for high-dimensional indexes which represent an important component of multimedia database systems. Since it is ver...
Stefan Berchtold, Christian Böhm, Hans-Peter ...
APAL
2010
113views more  APAL 2010»
15 years 5 months ago
Logic for update products and steps into the past
This paper provides a sound and complete proof system for a language Le+Y that adds to Dynamic Epistemic Logic (DEL) a discrete previous-time operator as well as single symbol for...
Joshua Sack
143
Voted
MFCS
2005
Springer
15 years 11 months ago
Strict Language Inequalities and Their Decision Problems
Systems of language equations of the form {ϕ(X1, . . . , Xn) = ∅, ψ(X1, . . . , Xn) = ∅} are studied, where ϕ, ψ may contain set-theoretic operations and concatenation; the...
Alexander Okhotin
FOSSACS
2010
Springer
16 years 6 days ago
A Hierarchy for Delimited Continuations in Call-by-Name
Λµ-calculus was introduced as a Böhm-complete extension of Parigot's λµ-calculus. Λµ-calculus, contrarily to Parigot's calculus, is a calculus of CBN delimited con...
Alexis Saurin