Sciweavers

618 search results - page 93 / 124
» Computational Models of Natural Language Argument
Sort
View
LICS
1991
IEEE
15 years 4 months ago
Logic Programming in a Fragment of Intuitionistic Linear Logic
When logic programming is based on the proof theory of intuitionistic logic, it is natural to allow implications in goals and in the bodies of clauses. Attempting to prove a goal ...
Joshua S. Hodas, Dale Miller
178
Voted
CMSB
2011
Springer
14 years 18 days ago
Coloured stochastic multilevel multiset rewriting
From the phosphorylation state of a molecule to the volume of a cell, parameters are ubiquitous in systems biology. At the same time, most models involve static or dynamic compart...
Nicolas Oury, Gordon D. Plotkin
121
Voted
ASP
2003
Springer
15 years 6 months ago
Parametric Connectives in Disjunctive Logic Programming
Disjunctive Logic Programming (DLP) is an advanced formalism for Knowledge Representation and Reasoning (KRR). DLP is very expressive in a precise mathematical sense: it allows to ...
Nicola Leone, Simona Perri
111
Voted
IR
2006
15 years 23 days ago
Full-text federated search of text-based digital libraries in peer-to-peer networks
Abstract. Peer-to-peer (P2P) networks integrate autonomous computing resources without requiring a central coordinating authority, which makes them a potentially robust and scalabl...
Jie Lu, Jamie Callan
ESOP
2012
Springer
13 years 8 months ago
The Call-by-Need Lambda Calculus, Revisited
The existing call-by-need λ calculi describe lazy evaluation via equational logics. A programmer can use these logics to safely ascertain whether one term is behaviorally equivale...
Stephen Chang, Matthias Felleisen