Sciweavers

1814 search results - page 96 / 363
» Extended First-Order Logic
Sort
View
CORR
2010
Springer
202views Education» more  CORR 2010»
15 years 3 months ago
The Complexity of Reasoning for Fragments of Autoepistemic Logic
Autoepistemic logic extends propositional logic by the modal operator L. A formula that is preceded by an L is said to be "believed". The logic was introduced by Moore ...
Nadia Creignou, Arne Meier, Michael Thomas, Heribe...
NGC
2000
Springer
124views Communications» more  NGC 2000»
15 years 3 months ago
Temporal Disjunctive Logic Programming
In this paper we introduce the logic programminglanguage Disjunctive Chronolog which combines the programming paradigms of temporal and disjunctive logic programming. Disjunctive C...
Manolis Gergatsoulis, Panos Rondogiannis, Themis P...
154
Voted
PVLDB
2011
14 years 10 months ago
Implementing Performance Competitive Logical Recovery
New hardware platforms, e.g. cloud, multi-core, etc., have led to a reconsideration of database system architecture. Our Deuteronomy project separates transactional functionality ...
David B. Lomet, Kostas Tzoumas, Michael J. Zwillin...
120
Voted
ATVA
2010
Springer
217views Hardware» more  ATVA 2010»
15 years 4 months ago
LTL Can Be More Succinct
Abstract. It is well known that modelchecking and satisfiability of Linear Temporal Logic (LTL) are Pspace-complete. Wolper showed that with grammar operators, this result can be e...
Kamal Lodaya, A. V. Sreejith
LPNMR
2001
Springer
15 years 7 months ago
plp: A Generic Compiler for Ordered Logic Programs
Abstract This paper describes a generic compiler, called plp, for translating ordered logic programs into standard logic programs under the answer set semantics. In an ordered logi...
James P. Delgrande, Torsten Schaub, Hans Tompits