Sciweavers

662 search results - page 96 / 133
» Logic Programming with Ordered Disjunction
Sort
View
FPGA
2010
ACM
276views FPGA» more  FPGA 2010»
14 years 4 months ago
Accelerating Monte Carlo based SSTA using FPGA
Monte Carlo based SSTA serves as the golden standard against alternative SSTA algorithms, but it is seldom used in practice due to its high computation time. In this paper, we acc...
Jason Cong, Karthik Gururaj, Wei Jiang, Bin Liu, K...
ISSTA
2004
ACM
14 years 1 months ago
Faster constraint solving with subtypes
Constraints in predicate or relational logic can be translated into boolean logic and solved with a SAT solver. For faster solving, it is common to exploit the typing of predicate...
Jonathan Edwards, Daniel Jackson, Emina Torlak, Vi...
WWW
2004
ACM
14 years 8 months ago
An agent system reasoning about the web and the user
The paper describes some innovations related to the ongoing work on the GSA prototype, an integrated information retrieval agent. In order to improve the original system effective...
Giovambattista Ianni, Francesco Ricca, Francesco C...
ICAI
2004
13 years 9 months ago
Automatic Generation of English-language Steps in Puzzle Solving
This paper shows how to generate an English step-by-step explanation that describes how an automated reasoning system solves a complex logic program. We limit our attention to pro...
Hemantha Ponnuru, Raphael A. Finkel, Victor W. Mar...
FM
2003
Springer
174views Formal Methods» more  FM 2003»
14 years 24 days ago
Model-Checking TRIO Specifications in SPIN
We present a novel application on model checking through SPIN as a means for verifying purely descriptive specifications written in TRIO, a first order, linear-time temporal logic ...
Angelo Morzenti, Matteo Pradella, Pierluigi San Pi...