397 search results - page 15 / 80 » Optimizing Modular Logic Languages |
AMAI
2006
Springer
14 years 9 months ago
2006
Springer
Abstract. Recently, notions of equivalence for Answer Set Programming have been studied intensively and were shown to be beneficial for modular programming and automated optimizati...
ICALP
2010
Springer
15 years 2 months ago
2010
Springer
We prove that TAUT has a p-optimal proof system if and only if a logic related to least fixed-point logic captures polynomial time on all finite structures. Furthermore, we show ...
SCAM
2008
IEEE
15 years 4 months ago
2008
IEEE
Decompiling low-level code to a high-level intermediate representation facilitates the development of analyzers, model checkers, etc. which reason about properties of the low-leve...
INFSOF
2006
14 years 9 months ago
2006
Discrete EVent Systems Specification (DEVS) formalism supports specification of discrete event models in a hierarchical modular manner. This paper proposes a DEVS modeling languag...
LICS
2009
IEEE
15 years 4 months ago
2009
IEEE
We describe a substructural logic with ordered, linear, and persistent propositions and then endow a fragment with a committed choice forward-chaining operational interpretation. ...