Sciweavers

590 search results - page 6 / 118
» From Relational Specifications to Logic Programs
Sort
View
125
Voted
COLING
1992
15 years 5 months ago
A Logic Programming View of Relational Morphology
he more abstract term "relational morphology" in place of tile usual "two-level morphology" in order to emphasize an aspect of Koskenniemi's work which ha...
Harvey Abramson
146
Voted
IGPL
2010
117views more  IGPL 2010»
15 years 1 months ago
Executable specification of open multi-agent systems
Multi-agent systems where the agents are developed by parties with competing interests, and where there is no access to an agent's internal state, are often classified as `ope...
Alexander Artikis, Marek J. Sergot
271
Voted
ICLP
2009
Springer
16 years 4 months ago
Reducts of Propositional Theories, Satisfiability Relations, and Generalizations of Semantics of Logic Programs
Over the years, the stable-model semantics has gained a position of the correct (two-valued) interpretation of default negation in programs. However, for programs with aggregates (...
Miroslaw Truszczynski
169
Voted
SIGCSE
2000
ACM
453views Education» more  SIGCSE 2000»
15 years 8 months ago
Aristotle and object-oriented programming: why modern students need traditional logic
Classifying is a central activity in object-oriented programming and distinguishes it from procedural programming. Traditional logic, initiated by Aristotle, assigns classificatio...
Derek Rayside, Gerard T. Campbell
152
Voted
DLOG
2008
15 years 6 months ago
Taming the Infinite Chase: Query Answering under Expressive Relational Constraints
Answering queries posed over knowledge bases is a central problem in knowledge representation and database theory. In databases, query containment is one of the important query op...
Andrea Calì, Georg Gottlob, Michael Kifer