Sciweavers

4126 search results - page 185 / 826
» Set based logic programming
Sort
View
146
Voted
SEMWEB
2010
Springer
15 years 11 days ago
Representing and Querying Validity Time in RDF and OWL: A Logic-Based Approach
RDF(S) and OWL 2 currently support only static ontologies. In practice, however, the truth of statements often changes with time, and Semantic Web applications often need to repres...
Boris Motik
132
Voted
FUIN
2010
83views more  FUIN 2010»
14 years 12 months ago
Expressing Cardinality Quantifiers in Monadic Second-Order Logic over Trees
We study an extension of monadic second-order logic of order with the uncountability quantifier "there exist uncountably many sets". We prove that, over the class of fini...
Vince Bárány, Lukasz Kaiser, Alexand...
COMPASS
1994
15 years 6 months ago
Equations for Describing Dynamic Nets of Communicating Systems
We give a notation and a logical calculus for the description and deductive manipulation of dynamic networks of communicating components. We represent such nets by hierarchical sys...
Manfred Broy
130
Voted
TCS
2011
14 years 9 months ago
Realizability models and implicit complexity
New, simple, proofs of soundness (every representable function lies in a given complexity class) for Elementary Affine Logic, LFPL and Soft Affine Logic are presented. The proofs ...
Ugo Dal Lago, Martin Hofmann
ICLP
2005
Springer
15 years 8 months ago
OWL: A Description Logic Based Ontology Language
Abstract Description Logics (DLs) are a family of class (concept) based knowledge representation formalisms. They are characterised by the use of various constructors to build comp...
Ian Horrocks