344 search results - page 15 / 69 » Mathematical Programming Embeddings of Logic |
181
click to vote
POPL
2004
ACM
15 years 12 months ago
2004
ACM
We prove the decidability of the quantifier-free, static fragment of ambient logic, with composition adjunct and iteration, which corresponds to a kind of regular expression langu...
169
Voted
ICLP
2009
Springer
16 years 8 days ago
2009
Springer
Recently, enabling modularity aspects in Answer Set Programming (ASP) has gained increasing interest to ease the composition of program parts to an overall program. In this paper, ...
100
click to vote
PPDP
2009
Springer
15 years 6 months ago
2009
Springer
We propose a novel approach to encapsulate non-deterministic computations in functional logic programs. Our approach is based on set functions that return the set of all the resul...
COLING
1992
15 years 24 days ago
1992
he more abstract term "relational morphology" in place of tile usual "two-level morphology" in order to emphasize an aspect of Koskenniemi's work which ha...
115
Voted
TAP
2010
Springer
14 years 9 months ago
2010
Springer
Program verification systems based on automated theorem provers rely on user-provided axioms in order to verify domain-specific properties of code. However, formulating axioms corr...