Sciweavers

1143 search results - page 33 / 229
» Abstract Syntax and Logic Programming
Sort
View
TBILLC
2005
Springer
15 years 3 months ago
Natural Logic for Natural Language
We implement the extension of the logical consequence relation to a partial order ≤ on arbitary types built from e (entities) and t (Booleans) that was given in [1], and the de...
Jan van Eijck
ASP
2003
Springer
15 years 3 months ago
Suitable Graphs for Answer Set Programming
Abstract. Often graphs are used to investigate properties of logic programs. In general, different graphs represent different kinds of information of the corresponding programs. ...
Thomas Linke
LACL
2001
Springer
15 years 2 months ago
On the Distinction between Model-Theoretic and Generative-Enumerative Syntactic Frameworks
Abstract. Two kinds of framework for stating grammars of natural languages emerged during the 20th century. Here we call them generativeenumerative syntax (GES) and model-theoretic...
Geoffrey K. Pullum, Barbara C. Scholz
FROCOS
2007
Springer
15 years 4 months ago
Idempotent Transductions for Modal Logics
Abstract. We investigate the extension of modal logics by bisimulation quantifiers and present a class of modal logics which is decidable when augmented with bisimulation quanti...
Tim French
PLDI
2009
ACM
15 years 4 months ago
On PDG-based noninterference and its modular proof
We present the first machine-checked correctness proof for information flow control (IFC) based on program dependence graphs (PDGs). IFC based on slicing and PDGs is flow-sensi...
Daniel Wasserrab, Denis Lohner, Gregor Snelting