903 search results - page 42 / 181 » Completeness Results for Memory Logics |
191
click to vote
AAAI
1996
15 years 8 months ago
1996
This paper presents recent work using the Chill parser acquisition system to automate the construction of a natural-language interface for database queries. Chill treats parser ac...
146
click to vote
MFCS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. The parameterized complexity classes of the W -hierarchy are usually defined as the problems reducible to certain natural complete problems by means of fixed-parameter ...
164
click to vote
PLILP
1993
Springer
15 years 10 months ago
1993
Springer
Abstract. Solving equations in equational theories is a relevant programming paradigm which integrates logic and equational programming into one unified framework. Efficient metho...
170
click to vote
JANCL
2002
15 years 6 months ago
2002
In [8, 6] we introduced a family of `modal' languages intended for talking about distances. These languages are interpreted in `distance spaces' which satisfy some (or a...
149
click to vote
ORDER
2010
15 years 5 months ago
2010
This paper investigates quantum logic from the perspective of categorical logic, and starts from minimal assumptions, namely the existence of involutions/daggers and kernels. The ...