Sciweavers

2585 search results - page 124 / 517
» Automating Coherent Logic
Sort
View
LICS
1999
IEEE
14 years 2 months ago
Counting and Addition Cannot Express Deterministic Transitive Closure
An important open question in complexity theory is whether the circuit complexity class TC0 is (strictly) weaker than LOGSPACE. This paper considers this question from the viewpoi...
Matthias Ruhl
LICS
1992
IEEE
14 years 2 months ago
Compiler Verification in LF
We sketch a methodology for the verification of compiler correctness based on the LF Logical Framework as realized within the Elf programming language. We have applied this techni...
John Hannan, Frank Pfenning
ICLP
2010
Springer
14 years 1 months ago
Constraint Answer Set Programming Systems
Abstract. We present an integration of answer set programming and constraint processing as an interesting approach to constraint logic programming. Although our research is in a ve...
Christian Drescher
CSL
2006
Springer
14 years 1 months ago
Church Synthesis Problem with Parameters
For a two-variable formula (X, Y ) of Monadic Logic of Order (MLO) the Church Synthesis Problem concerns the existence and construction of an operator Y = F(X) such that (X, F(X)) ...
Alexander Moshe Rabinovich
DLOG
2008
14 years 11 days ago
Conjunctive Query Answering in SH using Knots
Answering conjunctive queries (CQs) has been recognized as a key task for the usage of Description Logics (DLs) in a number of applications. The problem has been studied by many au...
Magdalena Ortiz, Mantas Simkus, Thomas Eiter