Sciweavers

60 search results - page 6 / 12
» Infinitary Action Logic: Complexity, Models and Grammars
Sort
View
CORR
2007
Springer
177views Education» more  CORR 2007»
13 years 7 months ago
N3Logic: A Logical Framework For the World Wide Web
The Semantic Web drives towards the use of the Web for interacting with logically interconnected data. Through knowledge models such as Resource Description Framework (RDF), the S...
Tim Berners-Lee, Dan Connolly, Lalana Kagal, Yosi ...
ACSD
2005
IEEE
162views Hardware» more  ACSD 2005»
14 years 1 months ago
Complexity Results for Checking Distributed Implementability
We consider the distributed implementability problem as: Given a labeled transition system TS together with a distribution ∆ of its actions over a set of processes, does there ex...
Keijo Heljanko, Alin Stefanescu
ICLP
2010
Springer
13 years 11 months ago
Abductive Inference in Probabilistic Logic Programs
ABSTRACT. Action-probabilistic logic programs (ap-programs) are a class of probabilistic logic programs that have been extensively used during the last few years for modeling behav...
Gerardo I. Simari, V. S. Subrahmanian
ER
2007
Springer
167views Database» more  ER 2007»
13 years 11 months ago
An Unified Dynamic Description Logic Model for Databases: Relational Data, Relational Operations and Queries
The paper presents an unified Description Logic (DL) model for databases. Describing database models using DLs is a fundamental problem in many areas because it turns databases to...
Guoshun Hao, Shilong Ma, Yuefei Sui, Jianghua Lv
LICS
1994
IEEE
13 years 12 months ago
On the Parallel Complexity of Model Checking in the Modal Mu-Calculus
The modal mu-calculus is an expressive logic that can be used to specify safety and liveness properties of concurrent systems represented as labeled transition systems (LTSs). We ...
Shipei Zhang, Oleg Sokolsky, Scott A. Smolka