Sciweavers

CORR
2010
Springer
105views Education» more  CORR 2010»
13 years 4 months ago
Nominal Unification from a Higher-Order Perspective
Abstract. Nominal Logic is an extension of first-order logic with equality, name-binding, name-swapping, and freshness of names. Contrarily to higher-order logic, bound variables a...
Jordi Levy, Mateu Villaret
CORR
2010
Springer
75views Education» more  CORR 2010»
13 years 4 months ago
Explicit Evidence Systems with Common Knowledge
Justification logics are epistemic logics that explicitly include justifications for the agents' knowledge. We develop a multi-agent justification logic with evidence terms fo...
Samuel Bucheli, Roman Kuznets, Thomas Studer
AML
2007
80views more  AML 2007»
13 years 4 months ago
Normal forms for fuzzy logics: a proof-theoretic approach
A method is described for obtaining conjunctive normal forms for logics using Gentzen-style rules possessing a special kind of strong invertibility. This method is then applied to ...
Petr Cintula, George Metcalfe
APAL
2008
159views more  APAL 2008»
13 years 4 months ago
Approximations of modal logics: K and beyond
Inspired by recent work on approximations of classical logic, we present a method that approximates several modal logics in a modular way. Our starting point is the limitation of ...
Guilherme de Souza Rabello, Marcelo Finger
APAL
2010
111views more  APAL 2010»
13 years 4 months ago
Resource modalities in tensor logic
The description of resources in game semantics has never achieved the simplicity and precision of linear logic, because of the misleading conception that linear logic is more prim...
Paul-André Melliès, Nicolas Tabareau
AMAI
2007
Springer
13 years 4 months ago
Partial equilibrium logic
Abstract. Partial equilibrium logic (PEL) is a new nonmonotonic reasoning formalism closely aligned with logic programming under well-founded and partial stable model semantics. In...
Pedro Cabalar, Sergei P. Odintsov, David Pearce, A...
AMAI
2008
Springer
13 years 4 months ago
Set based logic programming
In a previous paper [BMR01], the authors showed that the mechanism underlying Logic Programming can be extended to handle the situation where the atoms are interpreted as subsets o...
Howard A. Blair, Victor W. Marek, Jeffrey B. Remme...
AI
2010
Springer
13 years 4 months ago
A logic of delegation
Delegation is a foundational concept for understanding and engineering systems that interact and execute tasks autonomously. By extending recent work on tensed action logic, it be...
Timothy J. Norman, Chris Reed
AAECC
2010
Springer
114views Algorithms» more  AAECC 2010»
13 years 4 months ago
Termination of narrowing via termination of rewriting
Abstract Narrowing extends rewriting with logic capabilities by allowing logic variables in terms and by replacing matching with unification. Narrowing has been widely used in diff...
Naoki Nishida, Germán Vidal
DIAGRAMS
2010
Springer
13 years 4 months ago
Fragments of Spider Diagrams of Order and Their Relative Expressiveness
Abstract. Investigating the expressiveness of a diagrammatic logic provides insight into how its syntactic elements interact at the semantic level. Moreover, it allows for comparis...
Aidan Delaney, Gem Stapleton, John Taylor, Simon J...