Sciweavers

1950 search results - page 151 / 390
» Lambda-Free Logical Frameworks
Sort
View
AAAI
2006
15 years 8 months ago
Forgetting and Conflict Resolving in Disjunctive Logic Programming
We establish a declarative theory of forgetting for disjunctive logic programs. The suitability of this theory is justified by a number of desirable properties. In particular, one...
Thomas Eiter, Kewen Wang
AI
2006
Springer
15 years 6 months ago
Solving logic program conflict through strong and weak forgettings
We consider how to forget a set of atoms in a logic program. Intuitively, when a set of atoms is forgotten from a logic program, all atoms in the set should be eliminated from thi...
Yan Zhang, Norman Y. Foo
EGOV
2010
Springer
15 years 7 months ago
From Policy-Making Statements to First-Order Logic
Within a framework for enriched on-line discussion forums for e-government policy-making, pro and con statements for positions are input, structurally related, then logically repre...
Adam Wyner, Tom M. van Engers, Kiavash Bahreini
POPL
2003
ACM
16 years 7 months ago
Pure patterns type systems
We introduce a new framework of algebraic pure type systems in which we consider rewrite rules as lambda terms with patterns and rewrite rule application as abstraction applicatio...
Gilles Barthe, Horatiu Cirstea, Claude Kirchner, L...
DLOG
2007
15 years 9 months ago
Automated Evaluation of Description Logic Reasoning Systems
Abstract. The DL implementation group (DIG) has specified a common interface for description logic reasoner. While the original intention was to make it easier for other tools to ...
Sebastian Wandelt