2752 search results - page 154 / 551 » Rounding to an Integral Program |
KRDB
1996
13 years 11 months ago
1996
Metaprogramming adds new expressive power to logic programming which can be advantageous to transfer to the field of deductive databases. We propose metaprogramming as a way to mo...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
Open Answer Set Programming (OASP) is an attractive framework for integrating ontologies and rules. In general OASP is undecidable. In previous work we provided a tableau-based alg...
IJCSA
2007
13 years 10 months ago
2007
This article presents experiences in the automation of a testing process. The main goal is the unified testing of not only one program, but a whole family of programs. The family ...
AAAI
2012
12 years 14 days ago
2012
Temporal Action Logics (TAL) is a class of temporal logics for reasoning about actions. We present a reformulation of TAL in Answer Set Programming (ASP), and discuss some synergi...
VLSID
2004
IEEE
14 years 10 months ago
2004
IEEE
This paper presents a novel technique for abstracting designs in order to increase the efficiency of formal property checking. Bounded Model Checking (BMC), using Satisfiability (...