Sciweavers

571 search results - page 38 / 115
» Domain Theory in Logical Form
Sort
View
LPNMR
2004
Springer
15 years 3 months ago
Logic Programs With Monotone Cardinality Atoms
We investigate mca-programs, that is, logic programs with clauses built of monotone cardinality atoms of the form kX , where k is a non-negative integer and X is a finite set of ...
V. Wiktor Marek, Ilkka Niemelä, Miroslaw Trus...
SLP
1997
102views more  SLP 1997»
14 years 11 months ago
Compositionality of Normal Open Logic Programs
Compositionality of programsis an important concern in knowledge representation and software development. In the context of Logic Programming, up till now, the issue has mostly be...
Sofie Verbaeten, Marc Denecker, Danny De Schreye
SIGLEX
1991
15 years 1 months ago
Lexicon, Ontology, and Text Meaning
A computationally relevant theory of lexical semantics must take into consideration both the form and the content of three different static knowledge sources -- the lexicon, the o...
Boyan A. Onyshkevych, Sergei Nirenburg
BC
2005
80views more  BC 2005»
14 years 9 months ago
Dynamics of multifrequency coordination using parametric driving: theory and experiment
Abstract The coupling of movement behavior and environmental signals has been extensively studied within the domain of rhythmic coordination tasks. However, in contrast to most tra...
Collins G. Assisi, Viktor K. Jirsa, J. A. Scott Ke...
AI
2004
Springer
14 years 9 months ago
ASSAT: computing answer sets of a logic program by SAT solvers
We propose a new translation from normal logic programs with constraints under the answer set semantics to propositional logic. Given a normal logic program, we show that by addin...
Fangzhen Lin, Yuting Zhao