Sciweavers

102 search results - page 12 / 21
» The Basic Constructive Logic for Negation-Consistency
Sort
View
ENTCS
2002
113views more  ENTCS 2002»
13 years 7 months ago
A monadic approach to polycategories
In the quest for an elegant formulation of the notion of "polycategory" we develop a more symmetric counterpart to Burroni's notion of "T-category", where ...
Jürgen Koslowski
DLOG
2007
13 years 10 months ago
Blocking Automata for PSPACE DLs
In Description Logics (DLs), both tableau-based and automata-based algorithms are frequently used to show decidability and complexity results for basic inference problems such as c...
Franz Baader, Jan Hladik, Rafael Peñaloza
ECAI
2000
Springer
13 years 12 months ago
An Embedding of ConGolog in 3APL
Several high-level programming languages for programming agents and robots have been proposed in recent years. Each of these languages has its own features and merits. It is still...
Koen V. Hindriks, Yves Lespérance, Hector J...
PODS
2008
ACM
152views Database» more  PODS 2008»
14 years 7 months ago
Towards a theory of schema-mapping optimization
A schema mapping is a high-level specification that describes the relationship between two database schemas. As schema mappings constitute the essential building blocks of data ex...
Ronald Fagin, Phokion G. Kolaitis, Alan Nash, Luci...
CORR
2010
Springer
194views Education» more  CORR 2010»
13 years 5 months ago
A Focused Sequent Calculus Framework for Proof Search in Pure Type Systems
Basic proof search tactics in logic and type theory can be seen as the root-rst applications of rules in an appropriate sequent calculus, preferably without the redundancies gener...
Stéphane Lengrand, Roy Dyckhoff, James McKi...