2148 search results - page 311 / 430 » From process logic to program logic |
AAAI
2006
13 years 9 months ago
2006
Recent research shows that SAT (propositional satisfiability) techniques can be employed to build efficient systems to compute answer sets for logic programs. ASSAT and CMODELS ar...
IJIT
2004
13 years 9 months ago
2004
Both software applications and their development environment are becoming more and more distributed. This trend impacts not only the way software computes, but also how it looks. T...
SAC
2008
ACM
13 years 7 months ago
2008
ACM
se a new abstraction for pointer analysis that represents reads and writes to memory instead of traditional points-to relations. Compared to points-to graphs, our Assign-Fetch Gra...
ICLP
2007
Springer
14 years 2 months ago
2007
Springer
As logic programming applications grow in size, Prolog systems need to efficiently access larger and larger data sets and the need for any- and multiargument indexing becomes more...
SAS
2007
Springer
14 years 2 months ago
2007
Springer
Denotational static analysis of Java bytecode has a nice and clean compositional definition and an efficient implementation with binary decision diagrams. But it models only the f...