Sciweavers

1017 search results - page 74 / 204
» Higher-Order Logic Programming Languages with Constraints: A...
Sort
View
AI
2004
Springer
14 years 9 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
FMOODS
2000
14 years 11 months ago
On a Temporal Logic for Object-Based Systems
This paper presents a logic, called BOTL (Object-Based Temporal Logic), that facilitates the specification of dynamic and static properties of object-based systems. The logic is ba...
Dino Distefano, Joost-Pieter Katoen, Arend Rensink
POPL
2007
ACM
15 years 10 months ago
A concurrent constraint handling rules implementation in Haskell with software transactional memory
Constraint Handling Rules (CHR) is a concurrent committedchoice constraint logic programming language to describe transformations (rewritings) among multi-sets of constraints (ato...
Edmund S. L. Lam, Martin Sulzmann
APLAS
2010
ACM
14 years 10 months ago
A Logical Mix of Approximation and Separation
We extract techniques developed in the Concurrent C minor project to build a framework for constructing logics that contain approximation and/or separation. Approximation occurs wh...
Aquinas Hobor, Robert Dockins, Andrew W. Appel
POPL
2002
ACM
15 years 10 months ago
Proving correctness of compiler optimizations by temporal logic
Many classical compiler optimizations can be elegantly expressed using rewrite rules of form: I = I if , where I, I are intermediate language instructions and is a property expre...
David Lacey, Neil D. Jones, Eric Van Wyk, Carl Chr...