Sciweavers

11022 search results - page 394 / 2205
» Programming Systems for Autonomy
Sort
View
201
Voted
SAINT
2006
IEEE
16 years 26 days ago
A Comparison of Two Programming Models for Pervasive Computing
1 Establishing suitable programming models for pervasive spaces is essential in improving the productivity, enhancing the quality of pervasive systems, and creating an open platfor...
Hen-I Yang, Erwin Jansen, Sumi Helal
160
Voted
LPNMR
2005
Springer
16 years 11 days ago
Testing Strong Equivalence of Datalog Programs - Implementation and Examples
In this work we describe a system for determining strong equivalence of disjunctive non-ground datalog programs under the stable model semantics. The problem is tackled by reducing...
Thomas Eiter, Wolfgang Faber, Patrick Traxler
VMCAI
2005
Springer
16 years 10 days ago
Termination of Polynomial Programs
We present a technique to prove termination of multipath polynomial programs, an expressive class of loops that enables practical traction and analysis. The technique is based on ï...
Aaron R. Bradley, Zohar Manna, Henny B. Sipma
JELIA
2004
Springer
16 years 7 days ago
The CIFF Proof Procedure for Abductive Logic Programming with Constraints
Abstract. We introduce a new proof procedure for abductive logic programming and present two soundness results. Our procedure extends that of Fung and Kowalski by integrating abduc...
Ulrich Endriss, Paolo Mancarella, Fariba Sadri, Gi...
WLP
2004
Springer
16 years 6 days ago
A Pragmatic Approach to Pre-testing Prolog Programs
Abstract. We present an overview on the AT(x) approach which is capable of automatically analyzing programs with respect to given tests and a reference solution. In the context of ...
Christoph Beierle, Marija Kulas, Manfred Widera