2501 search results - page 108 / 501 » Logics with Rank Operators |
115
Voted
ICML
1989
IEEE
15 years 4 months ago
1989
IEEE
Logic programming provides a uniform framework in which all aspects of explanation-based generalization and learning may be defined and carried out, but first-order Horn logic i...
103
click to vote
CORR
2010
Springer
15 years 27 days ago
2010
Springer
Termination is an important and well-studied property for logic programs. However, almost all approaches for automated termination analysis focus on definite logic programs, where...
115
click to vote
ENTCS
2008
15 years 26 days ago
2008
Following earlier work, a modal logic for T-coalgebras is a functor L on a suitable variety. Syntax and proof system of the logic are given by presentations of the functor. This p...
110
Voted
ENTCS
2006
15 years 25 days ago
2006
Rewriting logic is a flexible and expressive logical framework that unifies algebraic denotational semantics and structural operational semantics (SOS) in a novel way, avoiding th...
122
Voted
ENTCS
2007
15 years 23 days ago
2007
We introduce a hybrid variant of a dynamic logic with continuous state transitions along differential equations, and we present a sequent calculus for this extended hybrid dynami...