Sciweavers

3481 search results - page 35 / 697
» Higher-Order Logic Programming as Constraint Logic Programmi...
Sort
View
AI
2004
Springer
13 years 7 months ago
ASSAT: computing answer sets of a logic program by SAT solvers
We propose a new translation from normal logic programs with constraints under the answer set semantics to propositional logic. Given a normal logic program, we show that by addin...
Fangzhen Lin, Yuting Zhao
CADE
2007
Springer
14 years 8 months ago
Logical Interpretation: Static Program Analysis Using Theorem Proving
Abstract. This paper presents the foundations for using automated deduction technology in static program analysis. The central principle is the use of logical lattices ? a class of...
Ashish Tiwari, Sumit Gulwani
CP
2009
Springer
14 years 8 months ago
From Model-Checking to Temporal Logic Constraint Solving
Abstract. In this paper, we show how model-checking can be generalized to temporal logic constraint solving, by considering temporal logic formulae with free variables over some do...
Aurélien Rizk, François Fages
AAAI
2008
13 years 8 months ago
Querying Sequential and Concurrent Horn Transaction Logic Programs Using Tabling Techniques
In this poster we describe the tabling techniques for Sequential and Concurrent Horn Transaction Logic. Horn Transaction Logic is an extension of classical logic programming with ...
Paul Fodor
TAP
2010
Springer
134views Hardware» more  TAP 2010»
13 years 5 months ago
Testing First-Order Logic Axioms in Program Verification
Program verification systems based on automated theorem provers rely on user-provided axioms in order to verify domain-specific properties of code. However, formulating axioms corr...
Ki Yung Ahn, Ewen Denney