280 search results - page 30 / 56 » Equivalence of Two Formal Semantics for Functional Logic Pro... |
101
Voted
KR
2000
Springer
15 years 7 months ago
2000
Springer
Bondarenko et al. have recently proposed an extension of the argumentation-theoretic semantics of admissible and preferred arguments, originally proposed for logic programming onl...
143
Voted
LICS
1994
IEEE
15 years 7 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 ...
152
click to vote
LICS
2007
IEEE
15 years 10 months ago
2007
IEEE
The combination of first-order epistemic logic and formal cryptography offers a potentially very powerful framework for security protocol verification. In this article, we addre...
143
Voted
PPDP
2007
Springer
15 years 9 months ago
2007
Springer
The problem of mechanically formalizing and proving metatheoretic properties of programming language calculi, type systems, operational semantics, and related formal systems has r...
236
Voted
SIGLEX
1991
15 years 7 months ago
1991
The lexical entry for a word must contain all the information needed to construct a semantic representation for sentences that contain the word. Because of that requirement, the f...