3738 search results - page 93 / 748 » Parametrized Logic Programming |
LICS
1994
IEEE
14 years 4 days ago
1994
IEEE
The theory of cut-free sequent proofs has been used to motivate and justify the design of a number of logic programming languages. Two such languages, Prolog and its linear logic ...
AAAI
1996
13 years 9 months ago
1996
We describe a program called SketchIT that transforms a single sketch of a mechanical device into multiple families of new designs. It represents each of these families with a &qu...
ASP
2003
Springer
14 years 1 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...
ECSQARU
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Both in classical logic and in Answer Set Programming, inconsistency is characterized by non existence of a model. Whereas every formula is a theorem for inconsistent set...
POPL
2008
ACM
14 years 8 months ago
2008
ACM
We propose a novel approach to proving the termination of heapmanipulating programs, which combines separation logic with cyclic proof within a Hoare-style proof system. Judgement...