Sciweavers

977 search results - page 104 / 196
» Logic programming with infinite sets
Sort
View
LANMR
2007
15 years 2 months ago
Handling Exceptions in nonmonotonic reasoning
Abstract We introduce some differences in the style defeasible information is represented and inferences are made in nonmonotonic reasoning. These, at first sight harmless, chang...
Marcelino C. Pequeno, Rodrigo de M. S. Veras, Wlad...
119
Voted
TCS
2010
14 years 11 months ago
Translating propositional extended conjunctions of Horn clauses into Boolean circuits
Horn⊃ is a logic programming language which extends usual Horn clauses by adding intuitionistic implication in goals and clause bodies. This extension can be seen as a form of s...
Joxe Gaintzarain, Montserrat Hermo, Paqui Lucio, M...
POPL
2004
ACM
16 years 27 days ago
A bisimulation for dynamic sealing
We define seal, an untyped call-by-value -calculus with primitives for protecting abstract data by sealing, and develop a bisimulation proof method that is sound and complete with...
Eijiro Sumii, Benjamin C. Pierce
121
Voted
IGPL
2011
14 years 4 months ago
Generalized ordinal sums and translations
We extend the lattice embedding of the axiomatic extensions of the positive fragment of intuitionistic logic into the axiomatic extensions of intuitionistic logic to the setting of...
Nikolaos Galatos
139
Voted
WOA
2004
15 years 1 months ago
A Game-Theoretic Operational Semantics
Abstract-- In this paper we present the communication architecture of the DALI Logic Programming Agent-Oriented language and we discuss its semantics. We have designed a meta-level...
Arianna Tocchio, Stefania Costantini, Alessia Vert...