Sciweavers

97 search results - page 11 / 20
» A Systematic Proof Theory for Several Modal Logics
Sort
View
89
Voted
WSPI
2004
15 years 1 months ago
A Formal Theory of Conceptual Modeling Universals
Conceptual Modeling is a discipline of great relevance to several areas in Computer Science. In a series of papers [1,2,3] we have been using the General Ontological Language (GOL)...
Giancarlo Guizzardi, Gerd Wagner, Marten van Sinde...
CADE
2011
Springer
13 years 11 months ago
Experimenting with Deduction Modulo
Deduction modulo is a generic framework to describe proofs in a theory better than using raw axioms. This is done by presenting the theory through rules rewriting terms and proposi...
Guillaume Burel
LPNMR
1995
Springer
15 years 3 months ago
Hypothetical Updates, Priority and Inconsistency in a Logic Programming Language
In this paper we propose a logic programming language which supports hypothetical updates together with integrity constraints. The language allows sequences of updates by sets of a...
Dov M. Gabbay, Laura Giordano, Alberto Martelli, N...
109
Voted
LICS
2007
IEEE
15 years 6 months ago
Principles of Superdeduction
In predicate logic, the proof that a theorem P holds in a theory Th is typically conducted in natural deduction or in the sequent calculus using all the information contained in t...
Paul Brauner, Clément Houtmann, Claude Kirc...
88
Voted
ECAI
2010
Springer
15 years 23 days ago
Optimal Tableaux for Conditional Logics with Cautious Monotonicity
Conditional logics capture default entailment in a modal framework in which non-monotonic implication is a first-class citizen, and in particular can be negated and nested. There i...
Lutz Schröder, Dirk Pattinson, Daniel Hausman...