Sciweavers

23 search results - page 3 / 5
» ASP-PROLOG: A System for Reasoning about Answer Set Programs...
Sort
View
AUSAI
2006
Springer
13 years 9 months ago
LPForget: A System of Forgetting in Answer Set Programming
Abstract. A novel declarative approach of forgetting in answer set programming (ASP) has been proposed recently. In this paper we report a system prototype of forgetting in ASP, ca...
Fu-Leung Cheng, Thomas Eiter, Nathan Robinson, Abd...
LPNMR
1999
Springer
13 years 9 months ago
Representing Transition Systems by Logic Programs
This paper continues the line of research on representing actions, on the automation of commonsense reasoning and on planning that deals with causal theories and with action langua...
Vladimir Lifschitz, Hudson Turner
FLOPS
2004
Springer
13 years 9 months ago
Analysing Definitional Trees: Looking for Determinism
Abstract. This paper describes how high level implementations of (needed) narrowing into Prolog can be improved by analysing definitional trees. First, we introduce a refined repre...
Pascual Julián Iranzo, Christian Villamizar...
ICTAI
2007
IEEE
13 years 11 months ago
Establishing Logical Rules from Empirical Data
We review a method of generating logical rules, or axioms, from empirical data. This method, using closed set properties of formal concept analysis, has been previously described ...
John L. Pfaltz
CORR
2010
Springer
180views Education» more  CORR 2010»
13 years 5 months ago
A Meta-Programming Approach to Realizing Dependently Typed Logic Programming
Dependently typed lambda calculi such as the Logical Framework (LF) can encode relationships between terms in types and can naturally capture correspondences between formulas and ...
Zachary Snow, David Baelde, Gopalan Nadathur