Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
640
Uniform proofs as a foundation for logic programming
- ANNALS OF PURE AND APPLIED LOGIC
, 1991
"... A proof-theoretic characterization of logical languages that form suitable bases for Prolog-like programming languages is provided. This characterization is based on the principle that the declarative meaning of a logic program, provided by provability in a logical system, should coincide with its ..."
Abstract
-
Cited by 428 (122 self)
- Add to MetaCart
A proof-theoretic characterization of logical languages that form suitable bases for Prolog-like programming languages is provided. This characterization is based on the principle that the declarative meaning of a logic program, provided by provability in a logical system, should coincide
Well-Founded Semantics Coincides with Three-Valued Stable Semantics
- FUNDAMENTA INFORMATICAE
, 1990
"... We introduce 3-valued stable models which are a natural generalization of standard (2-valued) stable models. We show that every logic program P has at least one 3-valued stable model and that the wellfounded model of any program P [VGRS90] coincides with the smallest 3-valued stable model of P. We c ..."
Abstract
-
Cited by 155 (15 self)
- Add to MetaCart
We introduce 3-valued stable models which are a natural generalization of standard (2-valued) stable models. We show that every logic program P has at least one 3-valued stable model and that the wellfounded model of any program P [VGRS90] coincides with the smallest 3-valued stable model of P. We
A Sequent Based Logic for Coincidence Grids
"... Information is often represented in tabular format in everyday documents such as balance sheets, sales figures, and so on. Tables represent an interesting point in the spectrum of representation systems between pictures and sentences, since some aspect of tables are sentential or conventional in nat ..."
Abstract
- Add to MetaCart
in nature, while others are graphical. In this paper we describe the logic of a particular formalized tabular representation system, that of coincidence grids. Although less common than everyday tables, this system is recommended for use in the search for solution of so-called “Logic Puzzles”. Such puzzles
GraphLog: a Visual Formalism for Real Life Recursion
- In Proceedings of the Ninth ACM SIGACT-SIGMOD Symposium on Principles of Database Systems
, 1990
"... We present a query language called GraphLog, based on a graph representation of both data and queries. Queries are graph patterns. Edges in queries represent edges or paths in the database. Regular expressions are used to qualify these paths. We characterize the expressive power of the language a ..."
Abstract
-
Cited by 193 (18 self)
- Add to MetaCart
and show that it is equivalent to stratified linear Datalog, first order logic with transitive closure, and non-deterministic logarithmic space (assuming ordering on the domain). The fact that the latter three classes coincide was not previously known. We show how GraphLog can be extended to incorporate
Recursive Aggregates in Disjunctive Logic Programs: Semantics and Complexity
- In Proceedings of European Conference on Logics in Artificial Intelligence (JELIA
, 2004
"... Abstract. The addition of aggregates has been one of the most relevant enhancements to the language of answer set programming (ASP). They strengthen the modeling power of ASP, in terms of concise problem representations. While many important problems can be encoded using nonrecursive aggregates, som ..."
Abstract
-
Cited by 115 (15 self)
- Add to MetaCart
desirable criteria, such as minimality or coincidence with answer sets in the aggregate-free case. In this paper we define a semantics for disjunctive programs with arbitrary aggregates (including monotone, antimonotone, and nonmonotone aggregates). This semantics is a fully declarative, genuine
Stable Semantics for Disjunctive Programs
- New Generation Computing
, 1991
"... We introduce the stable model semantics for disjunctive logic programs and deductive databases, which generalizes the stable model semantics, defined earlier for normal (i.e., non-disjunctive) programs. Depending on whether only total (2-valued) or all partial (3-valued) models are used we obtain th ..."
Abstract
-
Cited by 169 (2 self)
- Add to MetaCart
We introduce the stable model semantics for disjunctive logic programs and deductive databases, which generalizes the stable model semantics, defined earlier for normal (i.e., non-disjunctive) programs. Depending on whether only total (2-valued) or all partial (3-valued) models are used we obtain
.81- Contract or coincidence:
"... Although a number of commentators have remarked upon the simi-larities between aspects of George Herbert Mead’s social psychology and Adam Smith’s Theory of Moral Sentiments, there has been no sys-tematic attempt to document the connection. This article attempts to do precisely that. First, the legi ..."
Abstract
- Add to MetaCart
on a concept of community. Mead’s div-ision of the self into the ’I ’ and the ’me ’ is central in forcing the shift from the one to the other. Smith’s account of moral action, it is then argued, rests upon the same logic. His ideas of ’changing roles in the fancy’, the ’impartial spectator
Complete Extensions in Argumentation Coincide with Three-Valued Stable Models in Logic Programming
, 2009
"... In this paper, we prove the correspondence between complete extensions in abstract argumentation and 3-valued stable models in logic programming. This result is in line with earlier work of [8] that identified the correspondence between the grounded extension in abstract argumentation and the well-f ..."
Abstract
-
Cited by 13 (3 self)
- Add to MetaCart
In this paper, we prove the correspondence between complete extensions in abstract argumentation and 3-valued stable models in logic programming. This result is in line with earlier work of [8] that identified the correspondence between the grounded extension in abstract argumentation and the well
Consistency of Clark's Completion and Existence of Stable Models
, 1994
"... The most general notion of canonical model for a logic program with negation is the one of stable model [9]. In [7] the stable models of a logic program are characterized by the well-supported Herbrand models of the program, and a new fixed point semantics that formalizes the bottom-up truth mainten ..."
Abstract
-
Cited by 170 (2 self)
- Add to MetaCart
The most general notion of canonical model for a logic program with negation is the one of stable model [9]. In [7] the stable models of a logic program are characterized by the well-supported Herbrand models of the program, and a new fixed point semantics that formalizes the bottom-up truth
Results 1 - 10
of
640
