Sciweavers

825 search results - page 94 / 165
» Modal Logics with Counting
Sort
View
SLOGICA
2002
98views more  SLOGICA 2002»
15 years 1 months ago
A Cut-Free Sequent System for the Smallest Interpretability Logic
In [Sas01], it was given a cut-free sequent system for the smallest interpretability logic IL. He first gave a cut-free system for IK4, a sublogic of IL, whose -free fragment is th...
Katsumi Sasaki
ICDT
2007
ACM
114views Database» more  ICDT 2007»
15 years 7 months ago
Axiomatizing the Logical Core of XPath 2.0
The first aim of this paper is to present the logical core of XPath 2.0: a logically clean, decidable fragment, which includes most navigational features of XPath 2.0 (complex co...
Balder ten Cate, Maarten Marx
APAL
2006
91views more  APAL 2006»
15 years 1 months ago
Computing interpolants in implicational logics
I present a new syntactical method for proving the Interpolation Theorem for the implicational fragment of intuitionistic logic and its substructural subsystems. This method, like...
Makoto Kanazawa
ECAI
2006
Springer
15 years 3 months ago
Count-As Conditionals, Classification and Context
Abstract. Searle represents constitutive norms as count-as conditionals, written as `X counts as Y in context C'. Grossi et al. study a class of these conditionals as `in cont...
Guido Boella, Leendert W. N. van der Torre
CODES
2008
IEEE
15 years 8 months ago
Don't forget memories: a case study redesigning a pattern counting ASIC circuit for FPGAs
Modern embedded compute platforms increasingly contain both microprocessors and field-programmable gate arrays (FPGAs). The FPGAs may implement accelerators or other circuits to s...
David Sheldon, Frank Vahid