Sciweavers

299 search results - page 17 / 60
» Mechanizing common knowledge logic using COQ
Sort
View
TIME
1994
IEEE
13 years 11 months ago
Belief Revision in a Discrete Temporal Probability-Logic
We describe a discrete time probabilitylogic for use as the representation language of a temporal knowledge base. In addition to the usual expressive power of a discrete temporal ...
Scott D. Goodwin, Howard J. Hamilton, Eric Neufeld...
CN
2004
63views more  CN 2004»
13 years 7 months ago
Policy-enabled mechanisms for feature interactions: reality, expectations, challenges
: This paper is based on the discussion during a panel that took place at the 7th Workshop on Feature Interactions in Telecommunications and Software Systems in Ottawa, Canada, Jun...
Petre Dini, Alexander Clemm, Tom Gray, Fuchun Jose...
DLOG
2011
12 years 11 months ago
Query Answering over SROIQ Knowledge Bases with SPARQL
W3C currently extends the SPARQL query language with so-called entailment regimes, which define how queries are evaluated using logical entailment relations. We describe a sound a...
Ilianna Kollia, Birte Glimm, Ian Horrocks
ICLP
1999
Springer
13 years 11 months ago
Event, Property, and Hierarchy in Order-Sorted Logic
Knowledge representation in logics, even in the order-sorted logic that includes a sort hierarchy, tends to lose the conciseness and the nuances of natural language. If we could c...
Ken Kaneiwa, Satoshi Tojo
TLDI
2010
ACM
247views Formal Methods» more  TLDI 2010»
14 years 4 months ago
F-ing modules
ML modules are a powerful language mechanism for decomposing programs into reusable components. Unfortunately, they also have a reputation for being “complex” and requiring fa...
Andreas Rossberg, Claudio V. Russo, Derek Dreyer