Sciweavers

1143 search results - page 183 / 229
» Abstract Syntax and Logic Programming
Sort
View
ANOR
2002
67views more  ANOR 2002»
14 years 10 months ago
An Improved Hybrid Model for the Generic Hoist Scheduling Problem
Abstract. The generic hoist scheduling problem is NP-hard and arises from automated manufacturing lines. In recent work using the constraint logic programming (CLP) formalism, a un...
Daniel Riera, Neil Yorke-Smith
SIGSOFT
2007
ACM
15 years 10 months ago
The symmetry of the past and of the future: bi-infinite time in the verification of temporal properties
Model checking techniques have traditionally dealt with temporal logic languages and automata interpreted over -words, i.e., infinite in the future but finite in the past. However...
Matteo Pradella, Angelo Morzenti, Pierluigi San Pi...
ADC
1999
Springer
97views Database» more  ADC 1999»
15 years 2 months 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
TLCA
2009
Springer
15 years 4 months ago
Lexicographic Path Induction
Abstract. Programming languages theory is full of problems that reduce to proving the consistency of a logic, such as the normalization of typed lambda-calculi, the decidability of...
Jeffrey Sarnat, Carsten Schürmann
SEMWEB
2005
Springer
15 years 3 months ago
Preferential Reasoning on a Web of Trust
Abstract. We introduce a framework, based on logic programming, for preferential reasoning with agents on the Semantic Web. Initially, we encode the knowledge of an agent as a logi...
Stijn Heymans, Davy Van Nieuwenborgh, Dirk Vermeir