Sciweavers

1269 search results - page 68 / 254
» Pi-Calculus in Logical Form
Sort
View
ESOP
2001
Springer
15 years 5 months ago
Semantics and Termination of Simply-Moded Logic Programs with Dynamic Scheduling
Abstract. In logic programming, dynamic scheduling refers to a situation where the selection of the atom in each resolution (computation) step is determined at runtime, as opposed ...
Annalisa Bossi, Sandro Etalle, Sabina Rossi, Jan-G...
ICDCS
1998
IEEE
15 years 4 months ago
Granularity Control for Distributed Execution of Logic Programs
Distributed execution of logic programs requires a match of granularity between a program and the distributed multi-processor it runs on to exploit its potential for performance f...
George Xirogiannis
ITP
2010
164views Mathematics» more  ITP 2010»
15 years 4 months ago
Nitpick: A Counterexample Generator for Higher-Order Logic Based on a Relational Model Finder
Nitpick is a counterexample generator for Isabelle/HOL that builds on Kodkod, a SAT-based first-order relational model finder. Nitpick supports unbounded quantification, (co)ind...
Jasmin Christian Blanchette, Tobias Nipkow
94
Voted
EUROPAR
1995
Springer
15 years 4 months ago
Relating Data-Parallelism and (And-) Parallelism in Logic Programs
Much work has been done in the areas of and–parallelism and data parallelism in Logic Programs. Such work has proceeded to a certain extent in an independent fashion. Both types...
Manuel V. Hermenegildo, Manuel Carro
ECAI
2008
Springer
15 years 2 months ago
Belief Revision through Forgetting Conditionals in Conditional Probabilistic Logic Programs
Abstract. In this paper, we present a revision strategy of revising a conditional probabilistic logic program (PLP) when new information is received (which is in the form of probab...
Anbu Yue, Weiru Liu