Sciweavers

2500 search results - page 247 / 500
» Logical Semantics of Modularisation
Sort
View
RR
2010
Springer
15 years 5 months ago
Defeasibility in Answer Set Programs via Argumentation Theories
Defeasible reasoning has been studied extensively in the last two decades and many different and dissimilar approaches are currently on the table. This multitude of ideas has made...
Hui Wan, Michael Kifer, Benjamin N. Grosof
DLOG
2010
15 years 4 months ago
Towards Formal Comparison of Ontology Linking, Mapping and Importing
Multiple distributed and modular ontology representation frameworks have recently appeared. They typically extend Description Logics (DL), with new constructs to represent relation...
Martin Homola, Luciano Serafini
CAV
1999
Springer
119views Hardware» more  CAV 1999»
15 years 11 months ago
A Theory of Restrictions for Logics and Automata
BDDs and their algorithms implement a decision procedure for Quanti ed Propositional Logic. BDDs are a kind of acyclic automata. Unrestricted automata (recognizing unbounded string...
Nils Klarlund
AGP
1998
IEEE
15 years 11 months ago
Dynamic Logic Programming
In this paper we investigate updates of knowledge bases represented by logic programs. In order to represent negative information, we use generalized logic programs which allow de...
José Júlio Alferes, João Alex...
ENTCS
2008
140views more  ENTCS 2008»
15 years 6 months ago
Higher-Order Separation Logic in Isabelle/HOLCF
We formalize higher-order separation logic for a first-order imperative language with procedures and local variables in Isabelle/HOLCF. The assertion language is modeled in such a...
Carsten Varming, Lars Birkedal