Sciweavers

36 search results - page 1 / 8
» Multi-adjoint Logic Programming with Continuous Semantics
Sort
View
LPNMR
2001
Springer
13 years 9 months ago
Multi-adjoint Logic Programming with Continuous Semantics
Abstract. Considering different implication operators, such as Lukasiewicz, G¨odel or product implication in the same logic program, naturally leads to the allowance of several a...
Jesús Medina, Manuel Ojeda-Aciego, Peter Vo...
PADL
2005
Springer
13 years 10 months ago
Towards Provably Correct Code Generation via Horn Logical Continuation Semantics
Abstract. Provably correct compilation is an important aspect in development of high assurance software systems. In this paper we explore approaches to provably correct code genera...
Qian Wang, Gopal Gupta, Michael Leuschel
IWFM
2003
172views Formal Methods» more  IWFM 2003»
13 years 6 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
LPNMR
2001
Springer
13 years 9 months ago
Fixpoint Characterizations for Many-Valued Disjunctive Logic Programs with Probabilistic Semantics
In this paper, we continue to explore many-valued disjunctive logic programs with probabilistic semantics. In particular, we newly introduce the least model state semantics for suc...
Thomas Lukasiewicz
LANMR
2004
13 years 6 months ago
New Semantics for Hybrid Probabilistic Programs
Hybrid probabilistic programs framework [5] is a variation of probabilistic annotated logic programming approach, which allows the user to explicitly encode the available knowledge...
Emad Saad