Sciweavers

76 search results - page 7 / 16
» Axiomatizing the Logic of Comparative Probability
Sort
View
JSYML
2010
107views more  JSYML 2010»
13 years 5 months ago
A proof of completeness for continuous first-order logic
Continuous first-order logic has found interest among model theorists who wish to extend the classical analysis of “algebraic” structures (such as fields, group, and graphs) ...
Arthur Paul Pedersen, Itay Ben-Yaacov
NMR
2004
Springer
14 years 24 days ago
Logic programs with annotated disjunctions
Current literature offers a number of different approaches to what could generally be called “probabilistic logic programming”. These are usually based on Horn clauses. Here, ...
Joost Vennekens, Sofie Verbaeten, Maurice Bruynoog...
IANDC
2010
116views more  IANDC 2010»
13 years 6 months ago
Weak bisimulation is sound and complete for pCTL*
Abstract. We investigate weak bisimulation of probabilistic systems in the presence of nondeterminism, i.e. labelled concurrent Markov chains (LCMC) with silent transitions. We bui...
Josée Desharnais, Vineet Gupta, Radha Jagad...

Book
1331views
15 years 6 months ago
Spatial Reasoning: Theory and Practice
"Spatial structures and spatial reasoning are essential to perception and cognition. Much day-to-day practical information is about what happens at certain spatial locations....
M. Aiello
SEMWEB
2009
Springer
14 years 2 months ago
Processing OWL2 Ontologies using Thea: An Application of Logic Programming
Traditional object-oriented programming languages can be difficult to use when working with ontologies, leading to the creation of domain-specific languages designed specifically...
Vangelis Vassiliadis, Jan Wielemaker, Chris Mungal...