Sciweavers

4126 search results - page 374 / 826
» Set based logic programming
Sort
View
AML
2005
84views more  AML 2005»
15 years 4 months ago
Modularity of proof-nets
When we cut a multiplicative proof-net of linear logic in two parts we get two modules with a certain border. We call pretype of a module the set of partitions over its border indu...
Roberto Maieli, Quintijn Puite
118
Voted
COLING
2002
15 years 4 months ago
The Chinese Aspect System and its Semantic Interpretation
: Motivated by a systematic representation of the Chinese aspect forms that explores their intrinsic semantics and temporal logical relations, we are constructing a Chinese aspect ...
Guowen Yang, John A. Bateman
INLG
2010
Springer
15 years 2 months ago
Grouping Axioms for More Coherent Ontology Descriptions
Ontologies and datasets for the Semantic Web are encoded in OWL formalisms that are not easily comprehended by people. To make ontologies accessible to human domain experts, sever...
Sandra Williams, Richard Power
FOIKS
2008
Springer
15 years 6 months ago
An Alternative Foundation for DeLP: Defeating Relations and Truth Values
Abstract. In this paper we recast the formalism of argumentation formalism known as DeLP (Defeasible Logic Programming) in game-theoretic terms. By considering a game between a Pro...
Ignacio D. Viglizzo, Fernando A. Tohmé, Gui...
CORR
2006
Springer
119views Education» more  CORR 2006»
15 years 4 months ago
Enhanced Prolog Remote Predicate Call Protocol
Following the ideas of the Remote Procedure Call model, we have developed a logic programming counterpart, naturally called Prolog Remote Predicate Call (Prolog RPC) [1]. The Prol...
Alin Suciu, Kalman Pusztai, Andrei Diaconu