Sciweavers

1020 search results - page 61 / 204
» Tight Semantics for Logic Programs
Sort
View
WCFLP
2005
ACM
14 years 2 months ago
Lightweight program specialization via dynamic slicing
Program slicing is a well-known technique that extracts from a program those statements which are relevant to a particular criterion. While static slicing does not consider any in...
Claudio Ochoa, Josep Silva, Germán Vidal
ICLP
2010
Springer
14 years 23 days ago
Tabling and Answer Subsumption for Reasoning on Logic Programs with Annotated Disjunctions
Probabilistic Logic Programming is an active field of research, with many proposals for languages, semantics and reasoning algorithms. One such proposal, Logic Programming with A...
Fabrizio Riguzzi, Terrance Swift
ICLP
1994
Springer
14 years 28 days ago
Splitting a Logic Program
In many cases, a logic program can be divided into two parts, so that one of them, the \bottom" part, does not refer to the predicates de ned in the \top" part. The \bot...
Vladimir Lifschitz, Hudson Turner
IWFM
2003
172views Formal Methods» more  IWFM 2003»
13 years 10 months ago
On Continuous Models of Computation: Towards Computing the Distance Between (Logic) Programs
We present a report on work in progress on certain aspects of a programme of research concerned with building formal, mathematical models both for aspects of the computational pro...
Anthony Karel Seda, Máire Lane
ICLP
2005
Springer
14 years 2 months ago
HYPROLOG: A New Logic Programming Language with Assumptions and Abduction
We present HYPROLOG, a novel integration of Prolog with assumptions and abduction which is implemented in and partly borrows syntax from Constraint Handling Rules (CHR) for integri...
Henning Christiansen, Verónica Dahl