Sciweavers

670 search results - page 15 / 134
» Modeling generalized implicatures using non-monotonic logics
Sort
View
ICALP
2000
Springer
13 years 11 months ago
Decidable First-Order Transition Logics for PA-Processes
We show the decidability of model checking PA-processes against several first-order logics based upon the reachability predicate. The main tool for this result is the recognizabil...
Denis Lugiez, Ph. Schnoebelen
ECAI
1998
Springer
13 years 11 months ago
The Complexity of Model Checking for Propositional Default Logics
Abstract. Default logic is one of the most widely used formalisms to formalize commonsense reasoning. In this paper we analyze the complexity of deciding whether a propositional in...
Paolo Liberatore, Marco Schaerf
BIRTHDAY
2004
Springer
14 years 24 days ago
Pure Type Systems in Rewriting Logic: Specifying Typed Higher-Order Languages in a First-Order Logical Framework
Abstract. The logical and operational aspects of rewriting logic as a logical framework are tested and illustrated in detail by representing pure type systems as object logics. Mor...
Mark-Oliver Stehr, José Meseguer
SPIESR
1996
141views Database» more  SPIESR 1996»
13 years 8 months ago
Describing and Classifying Multimedia Using the Description Logic GRAIL
Many applications would benefit if media objects such as images could be selected and classified (or clustered) such that "conceptually similar" images are grouped toget...
Carole A. Goble, Christian Haul, Sean Bechhofer
CMSB
2007
Springer
14 years 1 months ago
Context Sensitivity in Logical Modeling with Time Delays
For modeling and analyzing regulatory networks based on qualitative information and possibly additional temporal constraints, approaches using hybrid automata can be very helpful. ...
Heike Siebert, Alexander Bockmayr