A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
Guarded Open Answer Set Programming with Generalized Literals
[chapter]

2006
*
Lecture Notes in Computer Science
*

We extend the

doi:10.1007/11663881_11
fatcat:prjsvmhkgzeg3ivelze5zag4hy
*open**answer**set*semantics for*programs**with**generalized**literals*. ... However, reasoning under the*open**answer**set*semantics, in particular satisfiability checking of a predicate w.r.t. a*program*, is already undecidable for*programs*without*generalized**literals*. ... In*open**answer**set**programming*(OASP), we define a reduct that removes the*generalized**literals*. ...##
###
Open Answer Set Programming with Guarded Programs
[article]

2007
*
arXiv
*
pre-print

We further extend the

arXiv:cs/0603025v2
fatcat:3cvl4xjk6bhxhgjcaeijzkqvgu
*open**answer**set*semantics for*programs**with**generalized**literals*. Such*generalized**programs*(gPs) have interesting properties, e.g., the ability to express infinity axioms. ...*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. ...*programs**with**generalized**literals*and an*open**answer**set*semantics. ...##
###
Open answer set programming with guarded programs

2008
*
ACM Transactions on Computational Logic
*

We further extend the

doi:10.1145/1380572.1380575
fatcat:4czeusi3pjh6jlxga3k4fjrjje
*open**answer**set*semantics for*programs**with**generalized**literals*. Such*generalized**programs*(gPs) have interesting properties, e.g., the ability to express infinity axioms. ...*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. ...*programs**with**generalized**literals*and an*open**answer**set*semantics. ...##
###
Guarded Open Answer Set Programming
[chapter]

2005
*
Lecture Notes in Computer Science
*

*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. ... Whereas reasoning

*with*

*general*

*programs*in OASP is undecidable, the FPL translation of (loosely)

*guarded*

*programs*falls in the decidable (loosely)

*guarded*fixed point logic (µ(L)GF). ... Finite ASP was reduced to loosely

*guarded*OASP and the relationship

*with*Datalog LITE was made explicit. Finally, satisfiability checking w.r.t. ...

##
###
Guarded Hybrid Knowledge Bases
[article]

2007
*
arXiv
*
pre-print

Decidability of satisfiability checking of g-hybrid knowledge bases is shown for the particular DL DLRO, which is close to OWL DL, by a reduction to

arXiv:0711.2155v1
fatcat:vteqertlzbhpzmfjb32wdl5muu
*guarded**programs*under the*open**answer**set*semantics ... G-hybrid knowledge bases enable an integration of Description Logics and Logic*Programming*where, unlike in other approaches, variables in the rules of a*guarded**program*do not need to appear in positive ... Satisfiability checking w.r.t. the*open**answer**set*semantics is undecidable in*general*. ...##
###
Guarded hybrid knowledge bases

2008
*
Theory and Practice of Logic Programming
*

*answer*

*set*semantics. ... Decidability of satisfiability checking of g-hybrid knowledge bases is shown for the particular DL$\mathcal{DLRO}^{\-{le}}$, which is close to OWL DL, by a reduction to

*guarded*

*programs*under the

*open*... Satisfiability checking w.r.t. the

*open*

*answer*

*set*semantics is undecidable in

*general*. ...

##
###
Well-founded semantics for extended datalog and ontological reasoning

2013
*
Proceedings of the 32nd symposium on Principles of database systems - PODS '13
*

*set*semantics, and coincides

*with*the canonical model in case of stratified normal

*programs*. ... We prove that for

*guarded*Datalog ±

*with*negation under the standard WFS,

*answering*normal Boolean conjunctive queries is decidable, and we provide precise complexity results for this problem, namely, ... A

*guarded*(normal) Datalog ±

*program*is a finite

*set*of

*guarded*(N)TGDs. ...

##
###
Semantic Web Reasoning with Conceptual Logic Programs
[chapter]

2004
*
Lecture Notes in Computer Science
*

We extend

doi:10.1007/978-3-540-30504-0_9
fatcat:lcsryatlbrgjrnqfa5ucndphxu
*Answer**Set**Programming**with*, possibly infinite,*open*domains. ... Reasoning*with*the resulting Conceptual Logic*Programs*can be reduced to finite, normal*Answer**Set**Programming*, for which reasoners are available. ... Conclusions and Directions for Further Research We extended ASP*with**open*domains, defined CLPs to regain decidability, and reduced reasoning*with*CLPs to finite, closed, ASP. ...##
###
On the Complexity of Inductively Learning Guarded Rules
[article]

2021
*
arXiv
*
pre-print

We investigate the computational complexity of mining

arXiv:2110.03624v1
fatcat:qhjretsmqzhvpb2emrh4nxrb6u
*guarded*clauses from clausal datasets through the framework of inductive logic*programming*(ILP). ... Finally, we also generalise all of our results to k-*guarded*clauses for constant k. ... A*general*datalog-based framework for tractable query*answering*over ontologies. ...##
###
Queries with guarded negation

2012
*
Proceedings of the VLDB Endowment
*

computationally well behaved, in terms of testing query containment, query evaluation,

doi:10.14778/2350229.2350250
fatcat:aripunuyezfhrpdaslsci3lspu
*open*-world query*answering*, and boundedness. ... We introduce a fragment of SQL, called GN-SQL, as well as a fragment of Datalog*with*stratified negation, called GN-Datalog, that allow only*guarded*negation, and we show that these query languages are ... In each of these*settings*,*open*world query*answering*is an extensively researched problem. ...##
###
Open answer set programming for the semantic web

2007
*
Journal of Applied Logic
*

We extend

doi:10.1016/j.jal.2006.02.001
fatcat:iida6eh32batzlpksmbnfcfpjy
*answer**set**programming*(ASP)*with*, possibly infinite,*open*domains. ... An EFoLP*answer**set*of such a (Q, R) is defined as an*open**answer**set*of Q ∪ R , where R is the*program*R grounded*with*constants from Q ∪ R. ... To avoid confusion*with*EFoLP*answer**sets*and*open**answer**sets*, we assume an EFoLP P is a FoLP Q extended*with*a ground DLP R, i.e., P = Q ∪ R, under an*open**answer**set*semantics. ...##
###
Synthesis from Temporal Specifications Using Preferred Answer Set Programming
[chapter]

2005
*
Lecture Notes in Computer Science
*

Under the

doi:10.1007/11560586_23
fatcat:z3vi5amfibdsfbjrkpnmtshdtq
*open**answer**set*, there are some*programs*that do not have any solutions. ... This translation, to the best of our knowledge the first of its kind for CTL, allows CTL reasoning*with*existing*answer**set*solvers. ... A*program*is a finite*set*of rules α ← β where α is a*set*of*literals**with*|α| ≤ 1, i.e. α is empty or a singleton, and β is a finite*set*of extended*literals*. ...##
###
Scalable estimation-of-distribution program evolution

2007
*
Proceedings of the 9th annual conference on Genetic and evolutionary computation - GECCO '07
*

I present a new estimation-of-distribution approach to

doi:10.1145/1276958.1277072
dblp:conf/gecco/Looks07
fatcat:ion2ltl5xza6bj2h2ajddk7fpa
*program*evolution where distributions are not estimated over the entire space of*programs*. ... Rather, a novel representationbuilding procedure that exploits domain knowledge is used to dynamically select*program*subspaces for estimation over. ... To define ENF, let's introduce some terminology: 1 • The*guard**set*of an internal node is all of its children that are*literals*, and the*guard**set*of a*literal*is itself. • A branch*set*is the union of ...##
###
Stable Model Semantics for Tuple-Generating Dependencies Revisited

2017
*
Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems - PODS '17
*

Normal tuple-

doi:10.1145/3034786.3034794
dblp:conf/pods/AlvianoMP17
fatcat:jbbnvkoxijf6bpdku2wdkfaz6u
*generating*dependencies (NTGDs) are TGDs enriched*with*default negation, a.k.a. negation as failure. ... We then perform an in-depth complexity analysis of query*answering*under prominent classes of NTGDs based on the main decidability paradigms for TGDs, namely weak-acyclicity,*guardedness*and stickiness ... For brevity, conjunctions of*literals*are often identified*with*the*sets*of their*literals*. ...##
###
No Registration Needed: How to Use Declarative Policies and Negotiation to Access Sensitive Resources on the Semantic Web
[chapter]

2004
*
Lecture Notes in Computer Science
*

Gaining access to sensitive resources on the Web usually involves an explicit registration step, where the client has to provide a predetermined

doi:10.1007/978-3-540-25956-5_24
fatcat:hq5zugtl7rgjjn2ert5v5ylcse
*set*of information to the server. ... However, since the clients have to unconditionally provide the information, there is no way that they can discuss their misgivings*with*the server. ... All but the last*set*are*guards*, and all the*literals*in one*set*must evaluate to true before any*literals*in the next*set*are evaluated. ...
« Previous

*Showing results 1 — 15 out of 27,626 results*