Sciweavers

393 search results - page 62 / 79
» Logic Programs with Classical Negation
Sort
View
ADC
1999
Springer
97views Database» more  ADC 1999»
14 years 23 days ago
Pseudo-Naive Evaluation
We introduce pseudo-naive evaluation, a method for execution of mixed top-down/bottom-up logic programs and deductive databases. The method is intermediate in power between naive ...
Donald A. Smith, Mark Utting
PADL
2004
Springer
14 years 1 months ago
Implementing Cut Elimination: A Case Study of Simulating Dependent Types in Haskell
Gentzen’s Hauptsatz – cut elimination theorem – in sequent calculi reveals a fundamental property on logic connectives in various logics such as classical logic and intuition...
Chiyan Chen, Dengping Zhu, Hongwei Xi
CCE
2004
13 years 8 months ago
Optimization under uncertainty: state-of-the-art and opportunities
A large number of problems in production planning and scheduling, location, transportation, finance, and engineering design require that decisions be made in the presence of uncer...
Nikolaos V. Sahinidis
TPHOL
1999
IEEE
14 years 22 days ago
Lifted-FL: A Pragmatic Implementation of Combined Model Checking and Theorem Proving
Combining theorem proving and model checking o ers the tantalizing possibility of e ciently reasoning about large circuits at high levels of abstraction. We have constructed a syst...
Mark Aagaard, Robert B. Jones, Carl-Johan H. Seger
CLIMA
2006
13 years 10 months ago
Adding Evolving Abilities to a Multi-Agent System
This paper reports on a fertile marriage between madAgents, a Java and Prolog based multi-agent platform, and EVOLP, a logic programming based language to represent and reason abou...
João Leite, Luís Soares