Sciweavers

4217 search results - page 108 / 844
» Computational indistinguishability logic
Sort
View
DLOG
2003
14 years 11 months ago
Computing Least Common Subsumers for FLE+
Transitive roles are important for adequate representation of knowledge in a range of applications. In this paper we present a first algorithm to compute least common subsumers i...
Sebastian Brandt, Anni-Yasmin Turhan
AMC
2006
125views more  AMC 2006»
14 years 10 months ago
A symbolic and algebraic computation based Lambda-Boolean reduction machine via PROLOG
This paper presents a new Lambda-Boolean reduction machine for Lambda-Boolean and Lambda-Beta Boolean reductions in the context of Lambda Calculus and introduces the role of Churc...
Seref Mirasyedioglu, Tolga Güyer
ISIPTA
2005
IEEE
151views Mathematics» more  ISIPTA 2005»
15 years 3 months ago
Towards a Unifying Theory of Logical and Probabilistic Reasoning
Logic and probability theory have both a long history in science. They are mainly rooted in philosophy and mathematics, but are nowadays important tools in many other fields such...
Rolf Haenni
CSR
2010
Springer
15 years 2 months ago
Frameworks for Logically Classifying Polynomial-Time Optimisation Problems
We show that a logical framework, based around a fragment of existential second-order logic formerly proposed by others so as to capture the class of polynomially-bounded P-optimi...
James Gate, Iain A. Stewart
ALP
1994
Springer
15 years 2 months ago
Logic Programs as term Rewriting Systems
This paper studies the relationship between logic programs and term rewriting systems (TRSs). A compositional transform is de ned which given a logic program computes a TRS. For a...
Massimo Marchiori