Sciweavers

2649 search results - page 222 / 530
» Temporal Theories of Reasoning
Sort
View
LICS
2000
IEEE
15 years 11 months ago
The Role of Decidability in First Order Separations over Classes of Finite Structures
We establish that the decidability of the first order theory of a class of finite structures ¢ is a simple and useful condition for guaranteeing that the expressive power of FO...
Steven Lindell, Scott Weinstein
ECAI
1998
Springer
15 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
TPHOL
1997
IEEE
15 years 11 months ago
Type Classes and Overloading in Higher-Order Logic
Type classes and overloading are shown to be independent concepts that can both be added to simple higher-order logics in the tradition of Church and Gordon, without demanding more...
Markus Wenzel
ITP
2010
172views Mathematics» more  ITP 2010»
15 years 10 months ago
Equations: A Dependent Pattern-Matching Compiler
Abstract. We present a compiler for definitions made by pattern matching on inductive families in the Coq system. It allows to write structured, recursive dependently-typed functi...
Matthieu Sozeau
DLOG
2006
15 years 8 months ago
DL Actions with GCIs: a Pragmatic Approach
We recently proposed action formalisms based on description logics (DLs) as decidable fragments of well-established action theories such as the Situation Calculus and the Fluent C...
Hongkai Liu, Carsten Lutz, Maja Milicic, Frank Wol...