Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
272
Computing Answer Sets of a Logic Program via-enumeration of SAT certificates
"... This Conference Proceeding is brought to you for free and open access by ..."
Cooperating answer set programming
, 2006
"... Abstract. We present a formalism for logic program cooperation based on the answer set semantics. The system consists of independent logic programs that are connected via a sequential communication channel. When presented with an input set of literals from its predecessor, a logic program computes i ..."
Abstract
- Add to MetaCart
Abstract. We present a formalism for logic program cooperation based on the answer set semantics. The system consists of independent logic programs that are connected via a sequential communication channel. When presented with an input set of literals from its predecessor, a logic program computes
Open answer set programming with guarded programs
, 2006
"... Open answer set programming (OASP) is an extension of answer set programming where one may ground a program with an arbitrary superset of the program’s constants. We define a fixed point logic (FPL) extension of Clark’s completion such that open answer sets correspond to models of FPL formulas and i ..."
Abstract
-
Cited by 15 (6 self)
- Add to MetaCart
to loosely guarded OASP, enabling for the first time, a characterization of an answer set semantics by µLGF formulas. We further extend the open answer set semantics for programs with generalized literals. Such generalized programs (gPs) have interesting properties, e.g., the ability to express infinity
From Answer Set Logic Programming to Circumscription via Logic of GK
"... We first provide a mapping from Pearce’s equilibrium logic and Ferraris’s general logic programs to Lin and Shoham’s logic of knowledge and justified assumptions, a nonmonotonic modal logic that has been shown to include as special cases both Reiter’s default logic in the propositional case and Moor ..."
Abstract
- Add to MetaCart
We first provide a mapping from Pearce’s equilibrium logic and Ferraris’s general logic programs to Lin and Shoham’s logic of knowledge and justified assumptions, a nonmonotonic modal logic that has been shown to include as special cases both Reiter’s default logic in the propositional case
Materials for an exploratory theory of the network society.
- The British Journal of Sociology
, 2000
"... ABSTRACT This article aims at proposing some elements for a grounded theor y of the network society. The network society is the social structure characteristic of the Information Age, as tentatively identi ed by empirical, cross-cultural investigation. It permeates most societies in the world, in v ..."
Abstract
-
Cited by 122 (0 self)
- Add to MetaCart
networks as the predominant organizational form. Why now? The answer lies in the simultaneous availability of new, exible information technologies and a set of historical events, which came together by accident, around the late 1960s, and 1970s. These events include the restructuring of capitalism with its
Hierarchical decision making in multi-agent systems using answer set programming
, 2005
"... Abstract. We present a multi-agent formalism based on extended answer set programming. The system consists of independent agents connected via a communication channel, where knowledge and beliefs of each agent are represented by a logic program. When presented with an input set of literals from its ..."
Abstract
-
Cited by 6 (1 self)
- Add to MetaCart
Abstract. We present a multi-agent formalism based on extended answer set programming. The system consists of independent agents connected via a communication channel, where knowledge and beliefs of each agent are represented by a logic program. When presented with an input set of literals from its
From Default and Autoepistemic Logics to Disjunctive Answer Set Programs via the Logic of GK
"... Abstract. The logic of knowledge and justified assumptions, also known as logic of grounded knowledge (GK), was proposed by Lin and Shoham as a general logic for nonmonotonic reasoning. To date, it has been used to embed in it default logic (propositional case), au-toepistemic logic, Turner’s logic ..."
Abstract
- Add to MetaCart
Abstract. The logic of knowledge and justified assumptions, also known as logic of grounded knowledge (GK), was proposed by Lin and Shoham as a general logic for nonmonotonic reasoning. To date, it has been used to embed in it default logic (propositional case), au-toepistemic logic, Turner’s logic
CrowdDB: Answering . . .
, 2011
"... Some queries cannot be answered by machines only. Processing such queries requires human input for providing information that is missing from the database, for performing computationally difficult functions, and for matching, ranking, or aggregating results based on fuzzy criteria. CrowdDB uses huma ..."
Abstract
- Add to MetaCart
human input via crowdsourcing to process queries that neither database systems nor search engines can adequately answer. It uses SQL both as a language for posing complex queries and as a way to model data. While CrowdDB leverages many aspects of traditional database systems, there are also important
Abduction in Well-Founded Semantics and Generalized Stable Models via Tabled Dual Programs
- THEORY AND PRACTICE OF LOGIC PROGRAMMING
, 2004
"... Abductive logic programming oers a formalism to declaratively express and solve problems in areas such as diagnosis, planning, belief revision and hypothetical reasoning. Tabled logic programming oers a computational mechanism that provides a level of declarativity superior to that of Prolog, and wh ..."
Abstract
-
Cited by 57 (41 self)
- Add to MetaCart
. The result is the ability to compute abduction over well-founded semantics with explicit negation and answer sets. Our approach consists of a transformation and an evaluation method. The transformation adjoins to each objective literal O in a program, an objective literal not(O) along with rules that ensure
Under consideration for publication in Theory and Practice of Logic Programming 1 Justifying Answer Sets using Argumentation
, 2014
"... An answer set is a plain set of literals which has no further structure that would explain why certain literals are part of it and why others are not. We show how argumentation theory can help to explain why a literal is or is not contained in a given answer set by defining two justification methods ..."
Abstract
- Add to MetaCart
methods, both of which make use of the correspondence between answer sets of a logic program and stable extensions of the Assumption-Based Argumen-tation (ABA) framework constructed from the same logic program. Attack Trees justify a literal in argumentation-theoretic terms, i.e. using arguments
Results 1 - 10
of
272
