3470 search results - page 213 / 694 » Head-Elementary-Set-Free Logic Programs |
183
click to vote
ESWS
2005
Springer
16 years 4 hour ago
2005
Springer
We present extended conceptual logic programs (ECLPs), for which reasoning is decidable and, moreover, can be reduced to finite answer set programming. ECLPs are useful to reason ...
159
click to vote
LPNMR
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. This paper describes a system called SELP for studying strong equivalence in answer set logic programming. The basic function of the system is to check if two given groun...
152
click to vote
AAAI
1998
15 years 7 months ago
1998
The paper presents a constructive 3-valued semantics for autoepistemic logic (AEL). We introduce a derivation operator and de ne the semantics as its least xpoint. The semantics is...
138
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Nested words, a model for recursive programs proposed by Alur and Madhusudan, have recently gained much interest. In this paper we introduce quantitative extensions and study neste...
154
click to vote
LOGCOM
2007
15 years 6 months ago
2007
We begin by showing how to faithfully encode the Classical Modal Display Logic (CMDL) of Wansing into the Calculus of Structures (CoS) of Guglielmi. Since every CMDL calculus enjo...