Sciweavers

778 search results - page 84 / 156
» Expressiveness and complexity of graph logic
Sort
View
WWW
2011
ACM
14 years 7 months ago
A better uncle for OWL: nominal schemas for integrating rules and ontologies
We propose a description-logic style extension of OWL 2 with nominal schemas which can be used like“variable nominal classes”within axioms. This feature allows ontology langua...
Markus Krötzsch, Frederick Maier, Adila Krisn...
CORR
2011
Springer
174views Education» more  CORR 2011»
14 years 4 months ago
Parameter Learning of Logic Programs for Symbolic-Statistical Modeling
We propose a logical/mathematical framework for statistical parameter learning of parameterized logic programs, i.e. de nite clause programs containing probabilistic facts with a ...
Yoshitaka Kameya, Taisuke Sato
117
Voted
ASPDAC
2009
ACM
152views Hardware» more  ASPDAC 2009»
15 years 7 months ago
A novel Toffoli network synthesis algorithm for reversible logic
—Reversible logic studies have promising potential on energy lossless circuit design, quantum computation, nanotechnology, etc. Reversible logic features a one-to-one input outpu...
Yexin Zheng, Chao Huang
137
Voted
LOGCOM
1998
178views more  LOGCOM 1998»
15 years 4 days ago
Applying the Mu-Calculus in Planning and Reasoning about Action
Planning algorithms have traditionally been geared toward achievement goals in single-agent environments. Such algorithms essentially produce plans to reach one of a specified se...
Munindar P. Singh
SYNTHESE
2010
59views more  SYNTHESE 2010»
14 years 11 months ago
Frege's Begriffsschrift as a lingua characteristica
In this paper I suggest an answer to the question of what Frege means when he says that his logical system, the Begriffsschrift, is like the language Leibniz sketched, a lingua ch...
Tapio Korte