2540 search results - page 126 / 508 » Abstract Logics as Dialgebras |
190
click to vote
CADE
2012
Springer
13 years 9 months ago
2012
Springer
Abstract. This paper presents new results on the decidability of inductive validity of conjectures. For these results, a class of term rewrite systems (TRSs) with built-in linear i...
164
click to vote
SIAMCOMP
2012
13 years 9 months ago
2012
d Abstract) Sanjeev Arora∗ L´aszl´o Lov´asz† Ilan Newman‡ Yuval Rabani§ Yuri Rabinovich¶ Santosh Vempala Motivated by applications in combinatorial optimization, we ini...
179
click to vote
LICS
1994
IEEE
15 years 10 months ago
1994
IEEE
The theory of cut-free sequent proofs has been used to motivate and justify the design of a number of logic programming languages. Two such languages, Prolog and its linear logic ...
150
click to vote
DEON
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. Logical architectures combine several logics into a more complex logical system. In this paper we study a logical architecture using input/output operations corresponding...
201
click to vote
PPCP
1993
15 years 10 months ago
1993
Higher-order logic programming (HOLP) languages are particularly useful for various kinds of metaprogramming and theorem proving tasks because of the logical support for variable ...