Sciweavers

388 search results - page 34 / 78
» Scalable Web Reasoning Using Logic Programming Techniques
Sort
View
RR
2007
Springer
14 years 1 months ago
Decidability Under the Well-Founded Semantics
The well-founded semantics (WFS) for logic programs is one of the few major paradigms for closed-world reasoning. With the advent of the Semantic Web, it is being used as part of r...
Natalia Cherchago, Pascal Hitzler, Steffen Hö...
PADL
2010
Springer
14 years 4 months ago
Prospective Storytelling Agents
Abstract. Prospective Logic Programming is a declarative framework supporting the specification of autonomous agents capable of anticipating and reasoning about hypothetical futur...
Gonçalo Lopes, Luís Moniz Pereira
PLDI
2011
ACM
12 years 10 months ago
Separation logic + superposition calculus = heap theorem prover
Program analysis and verification tools crucially depend on the ability to symbolically describe and reason about sets of program behaviors. Separation logic provides a promising...
Juan Antonio Navarro Pérez, Andrey Rybalche...
SIGSOFT
2007
ACM
14 years 8 months ago
Quantitative verification: models techniques and tools
Automated verification is a technique for establishing if certain properties, usually expressed in temporal logic, hold for a system model. The model can be defined using a high-l...
Marta Z. Kwiatkowska
PLDI
2004
ACM
14 years 1 months ago
Cloning-based context-sensitive pointer alias analysis using binary decision diagrams
This paper presents the first scalable context-sensitive, inclusionbased pointer alias analysis for Java programs. Our approach to context sensitivity is to create a clone of a m...
John Whaley, Monica S. Lam