Login / Signup

Abstract Interpretation over Non-deterministic Finite Tree Automata for Set-Based Analysis of Logic Programs.

John P. GallagherGermán Puebla
Published in: PADL (2002)
Keyphrases
  • logic programs
  • stable models
  • logic programming
  • function symbols
  • abstract interpretation
  • background knowledge
  • answer set programming
  • horn clauses
  • tree automata
  • answer sets
  • fixpoint
  • static analysis
  • finite automata