Sciweavers

1194 search results - page 19 / 239
» A Language for Implementing Arbitrary Logics
Sort
View
ICLP
1997
Springer
15 years 1 months ago
The Complexity of Model Checking in Modal Event Calculi
Kowalski and Sergot’s Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which propert...
Iliano Cervesato, Massimo Franceschet, Angelo Mont...
LANMR
2004
14 years 11 months ago
Computing Preferred Safe Beliefs
We recently proposed a definition of a language for nonmonotonic reasoning based on intuitionistic logic. Our main idea is a generalization of the notion of answer sets for arbitr...
Luis A. Montiel, Juan A. Navarro
PPDP
2007
Springer
15 years 3 months ago
Interactive, scalable, declarative program analysis: from prototype to implementation
Static analyses provide the semantic foundation for tools ranging from optimizing compilers to refactoring browsers and advanced debuggers. Unfortunately, developing new analysis ...
William C. Benton, Charles N. Fischer
PADL
2004
Springer
15 years 3 months ago
Implementing Cut Elimination: A Case Study of Simulating Dependent Types in Haskell
Gentzen’s Hauptsatz – cut elimination theorem – in sequent calculi reveals a fundamental property on logic connectives in various logics such as classical logic and intuition...
Chiyan Chen, Dengping Zhu, Hongwei Xi
ISCIS
2009
Springer
15 years 4 months ago
XLambda: A functional programming language with XML syntax
—We describe XLambda, a functional language with XML syntax, and its processor which is implemented fully and completely in XSLT. XLambda has all the basic features of a function...
Ruhsan Onder, Zeki Bayram