4370 search results - page 341 / 874 » Algebra of Logic Programming |
197
click to vote
IJCAI
2001
15 years 8 months ago
2001
We give a graph theoretical characterization of answer sets of normal logic programs. We show that there is a one-to-one correspondence between answer sets and a special, non-stan...
197
click to vote
SPC
2005
Springer
16 years 24 days ago
2005
Springer
Abstract. Most attempts at analysing secure information flow in programs are based on domain-specific logics. Though computationally feahese approaches suffer from the need for ...
185
click to vote
ICFP
2006
ACM
16 years 7 months ago
2006
ACM
Generalized algebraic data types (GADTs), sometimes known as "guarded recursive data types" or "first-class phantom types", are a simple but powerful generaliz...
215
click to vote
ICALP
2005
Springer
16 years 25 days ago
2005
Springer
Bigraphs are emerging as a (meta-)model for concurrent calculi, like CCS, ambients, πcalculus, and Petri nets. They are built orthogonally on two structures: a hierarchical place...
197
click to vote
ECAI
2004
Springer
16 years 21 days ago
2004
Springer
In this work we further investigate the relation, first found by Truszczy´nski, between modal logic S4F and Default Logic (DL), analyzing some interesting properties and showing ...