Sciweavers

2062 search results - page 187 / 413
» Derivatives of Logical Formulas
Sort
View
AIML
2004
15 years 5 months ago
On the Complexity of Fragments of Modal Logics
We study and give a summary of the complexity of 15 basic normal monomodal logics under the restriction to the Horn fragment and/or bounded modal depth. As new results, we show tha...
Linh Anh Nguyen
CADE
2005
Springer
16 years 4 months ago
Reflecting Proofs in First-Order Logic with Equality
Our general goal is to provide better automation in interactive proof assistants such as Coq. We present an interpreter of proof traces in first-order multi-sorted logic with equal...
Evelyne Contejean, Pierre Corbineau
ECMDAFA
2006
Springer
166views Hardware» more  ECMDAFA 2006»
15 years 8 months ago
Dynamic Logic Semantics for UML Consistency
Abstract. The Unified Modelling Language (UML) is intended to describe systems, but it is not clear what systems satisfy a given collection of UML diagrams. Stephen Mellor has desc...
Greg O'Keefe
LMCS
2007
132views more  LMCS 2007»
15 years 4 months ago
The Complexity of Model Checking Higher-Order Fixpoint Logic
Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed λ-calculus and the modal µ-calculus. This makes it a highly expressive temporal logic that is capable of express...
Roland Axelsson, Martin Lange, Rafal Somla
TACAS
2007
Springer
99views Algorithms» more  TACAS 2007»
15 years 10 months ago
"Don't Care" Modeling: A Logical Framework for Developing Predictive System Models
Analysis of biological data often requires an understanding of components of pathways and/or networks and their mutual dependency relationships. Such systems are often analyzed and...
Hillel Kugler, Amir Pnueli, Michael J. Stern, E. J...