3319 search results - page 113 / 664 » Subshifts, Languages and Logic |
126
click to vote
ASP
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. We integrate an expressive class of description logics (DLs) and answer set programming by extending the latter to support inverted predicates and infinite domains, feat...
106
Voted
ESOP
2000
Springer
15 years 4 months ago
2000
Springer
Abstract. We show how a program analysis technique originally developed for C-like pointer structures can be adapted to analyse the hierarchical structure of processes in the ambie...
119
Voted
FLOPS
2008
Springer
15 years 2 months ago
2008
Springer
Narrowing extends rewriting with logic capabilities by allowing free variables in terms and replacing matching with unification. Narrowing has been widely used in different context...
101
Voted
HIS
2003
15 years 2 months ago
2003
We logically model uncertainty by expanding language without changing logical reasoning rules. We expand the language of set theory by adding new predicate symbols, uncertain membe...
142
click to vote
POPL
2011
ACM
14 years 3 months ago
2011
ACM
We describe a new algorithm for proving temporal properties expressed in LTL of infinite-state programs. Our approach takes advantage of the fact that LTL properties can often be...