27 search results - page 3 / 6 » Reachability Logic: An Efficient Fragment of Transitive Clos... |
82
Voted
CIE
2008
Springer
15 years 5 days ago
2008
Springer
There are many ways to define complexity in logic. In finite model theory, it is the complexity of describing properties, whereas in proof complexity it is the complexity of provin...
104
click to vote
AAAI
2000
14 years 11 months ago
2000
Answer-set programming (ASP) has emerged recently as a viable programming paradigm well attuned to search problems in AI, constraint satisfaction and combinatorics. Propositional ...
90
Voted
LICS
2009
IEEE
15 years 4 months ago
2009
IEEE
Pointer programs are a model of structured computation within logspace. They capture the common description of logspace algorithms as programs that take as input some structured d...
104
Voted
RTA
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. Declarative debugging is a semi-automatic technique that starts from an incorrect computation and locates a program fragment responsible for the error by building a tree ...
LMCS
2007
14 years 10 months ago
2007
Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed λ-calculus and the modal µ-calculus. This makes it a highly expressive temporal logic that is capable of express...