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

.

## Filters

##
###
Transforming floundering into success

2012
*
Theory and Practice of Logic Programming
*

We rely

doi:10.1017/s147106841200035x
fatcat:ts7wc25crjgzpcbfozvn5lkzdu
*on*some previously introduced restrictions*on*delay primitives and a key observation which allows properties such as*groundness*to be analysed by approximating the (*ground*) success*set*. ... This allows a declarative (model-theoretic), bottom-up or goal-independent approach to be used for*analysis*and debugging*of*properties related to floundering. ... Each (*non*-*ground*) atom has a*set**of*computed*answers*and for each*one*there is a*set**of*immediately floundered atoms. The*analysis*domain typically contains representations*of**sets**of*these triples. ...##
###
Tutorial on specialisation of logic programs

1993
*
Proceedings of the 1993 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation - PEPM '93
*

A renaming scheme for performing

doi:10.1145/154630.154640
dblp:conf/pepm/Gallagher93
fatcat:q2ayh5axorbcjguiearh2croii
*structure*specialisation is then described, and illustrated*on*a well-known string matching example. ... The specialisation*of*meta*programs*is very important in logic*programming*, and the*ground*representation for object*programs*has to be handled. Some techniques for doing this are described. ... In addition, care must be taken to ensure that the models*of**non*-*ground*meta-*programs*are the intended*ones*[HL89] . ...##
###
Towards Scalable Non-Monotonic Stream Reasoning via Input Dependency Analysis

2017
*
2017 IEEE 33rd International Conference on Data Engineering (ICDE)
*

In this paper, we address the issue

doi:10.1109/icde.2017.226
dblp:conf/icde/PhamMA17
fatcat:vy5l6qbcpjbuxprelyv42zc6eu
*of*scalability for nonmonotonic stream reasoning based*on**Answer**Set**Programming*(ASP) -an expressive reasoning approach based*on*disjunctive logic Datalog with negation ... We introduce an input dependency graph to represent the relationships between input events based*on*the*structure**of*a given logical rule*set*. ... The concept*of*dependency graph has been widely used in ASP as a tool to analyse the*structure**of**non*-*ground**answer**set**programs*[6] , [18] . ...##
###
Random vs. Structure-Based Testing of Answer-Set Programs: An Experimental Comparison
[chapter]

2011
*
Lecture Notes in Computer Science
*

In a recent paper, foundations for

doi:10.1007/978-3-642-20895-9_26
fatcat:ty2tkervgve7hpom4okab67tqi
*structure*-based testing*of**answer*-*set**programs*building*on*a number*of*coverage notions have been proposed. ...*Answer*-*set**programming*(ASP) is an established paradigm for declarative problem solving, yet comparably little work*on*testing*of**answer*-*set**programs*has been done so far. ... In this approach, testing is based*on*test cases that are chosen with respect to the internal*structure**of*a given*answer*-*set**program*. ...##
###
NoMoRe: A System for Non-Monotonic Reasoning under Answer Set Semantics
[chapter]

2001
*
Lecture Notes in Computer Science
*

Furthermore, we have included an interface to the graph drawing tool DaVinci [6] for visualization

doi:10.1007/3-540-45402-0_32
fatcat:ic5qzd5cpnc3lfp43zasqmcoiq
*of*block graphs. This allows for a*structural**analysis**of**programs*. ... Therefore Γ P captures all information necessary for computing the*answer**sets**of**program*P .*Answer**sets*then are characterized as special*non*-standard graph colorings*of*block graphs. ...##
###
A Generalised Semantics for Belief Updates - An Equivalence-based Approach

2013
*
Ciencias Huasteca Boletín Científico de la Escuela Superior de Huejutla
*

*Set*

*Programming*(ASP) que requiere de bases teóricas sólidas, particularmente en aplicaciones actuales de inteligencia artificial, donde un agente puede trabajar en un entorno dinámico abierto con información ... se sugiere en la literatura, la revisión y actualización de creencias y de bases del conocimiento, es un tema importante, aún no resuelto en la representación del conocimiento y del razonamiento en la

*Answer*... Accordingly,

*non*-

*ground*ASP-

*programs*with variables or constants as arguments are seen as a simplified expressions

*of*larger

*ground*(propositional)

*ones*without variables, where each

*ground*

*program*Π is ...

##
###
NoMoRe: Non-monotonic Reasoning with Logic Programs
[chapter]

2002
*
Lecture Notes in Computer Science
*

Thereforex y captures all information necessary for computing the

doi:10.1007/3-540-45757-7_46
fatcat:iollt2vve5hu3eybb7t54wi5tq
*answer**sets**of**program*r .*Answer**sets*are characterized as special*non*-standard graph colorings*of*block graphs. ... This allows for a*structural**analysis**of**programs*. grounder parser computing block graph compilation coloring visualizing block graph output Fig. 1 . The architecture*of*noMoRe. ...##
###
Efficient Groundness Analysis in Prolog
[article]

2002
*
arXiv
*
pre-print

The

arXiv:cs/0201012v1
fatcat:guqmyamo6za6rclc54dy2vvgiu
*analysis*can be implemented straightforwardly in Prolog and the use*of*a*non*-*ground*representation results in an efficient, scalable tool which does not require widening to be invoked, even*on*the ... Boolean functions can be used to express the*groundness**of*, and trace*grounding*dependencies between,*program*variables in (constraint) logic*programs*. ...*Groundness*Results: Larger*Programs*smaller*programs*, with EPos outperforming*non*-canonical Def*on*some*of*the larger benchmarks. ...##
###
Dialectical Explanations in Defeasible Argumentation
[chapter]

2007
*
Lecture Notes in Computer Science
*

We consider the

doi:10.1007/978-3-540-75256-1_28
fatcat:i4p7hijmtzhebc5xef2d6g7elu
*structures*that provide information*on*the warrant status*of*a literal. ... Although arguments represent a form*of*explanation for a literal, we study the complete*set**of*dialectical trees that justifies the warrant status*of*a literal, since this*set*has proved to be a useful ... Strict Rules represent*non*-defeasible information and are denoted L 0 ← L 1 , . . . , L n , where L 0 is a*ground*literal and {L i } i>0 is a*set**of**ground*literals (e.g., bird ← chicken) or ∼innocent ...##
###
Deriving polymorphic type dependencies for logic programs using multiple incarnations of Prop
[chapter]

1994
*
Lecture Notes in Computer Science
*

Type dependencies generalize the recently proposed notion

doi:10.1007/3-540-58485-4_47
fatcat:z4yfg6irvfd7fgfx3qbk7py6ca
*of*directional types as well as the more common notion*of**groundness*dependencies. ... We illustrate the use*of*a semantics for open logic*programs*in maintaining space e cient analyses. ... Lakshman and Eyal Yardeni for useful discusions*on*types. Bart Demoen is partially sponsored by contract IT/4*of*the Belgian D.W.T.C. ...##
###
Non-strict independence-based program parallelization using sharing and freeness information

2009
*
Theoretical Computer Science
*

Logic

doi:10.1016/j.tcs.2009.07.044
fatcat:mlyqfbx37bgrvah7tftagi7rni
*programs*allow studying the parallelization*of**programs*with complex, dynamic data*structures*with (declarative) pointers in a comparatively simple semantic*setting*. ...*Non*-strict independence cannot be determined solely at run-time ("a priori") and thus global*analysis*is a requirement. ... PROMESAS*program*. ...##
###
Parallel Logic Programming: A Sequel
[article]

2022
*
arXiv
*
pre-print

This has been paralleled by significant advances within logic

arXiv:2111.11218v2
fatcat:hek4fidju5fblprut2squ6o3rm
*programming*, such as tabling, more powerful static*analysis*and verification, the rapid growth*of**Answer**Set**Programming*, and in general, more ... Under consideration in Theory and Practice*of*Logic*Programming*(TPLP). ... based*on*stable models (also known as*answer**sets*), and a bottom-up model computation*on*a*ground*version*of*the*program*. ...##
###
Speeding up Lazy-Grounding Answer Set Solving

2018
*
International Conference on Logic Programming
*

The

doi:10.4230/oasics.iclp.2018.20
dblp:conf/iclp/Taupe18
fatcat:qmoqp6vjezdbvcokkvbefqense
*grounding*bottleneck is an important open issue in*Answer**Set**Programming*. Lazy*grounding*addresses it by interleaving*grounding*and search. ... The aim*of*this thesis is to extend prior work*on*lazy*grounding*by novel heuristics and other techniques like*non*-*ground*conflict learning in order to speed up solving. ... Semantics There are several ways to define the semantics*of*an*answer*-*set**program*, i.e. to define the*set**of**answer**sets**of*an*answer*-*set**program*. An overview is provided by [23] . ...##
###
On the Design of a Tool for Supporting the Construction of Logic Programs
[article]

2001
*
arXiv
*
pre-print

Our aim is to facilitate the learning

arXiv:cs/0111041v3
fatcat:gvwua3necfemfetus7q5apnmpq
*of*logic*programming*and to*set*the basis*of*more sophisticated tools for*program*development. ... We present a variant*of*the Deville methodology for logic*program*development, and the design*of*a tool for supporting the methodology. ... The first author thanks to Vladimir Támara and Luis Quesada, as well as the anonymous reviewers, for their remarks and comments*on*first drafts*of*this paper. ...##
###
Page 2399 of Mathematical Reviews Vol. , Issue 96d
[page]

1996
*
Mathematical Reviews
*

*of*variables, J (

*ground*(t)) is a

*set*

*of*substitutions that map ¢ into a

*set*

*of*

*ground*literals, and I(share(S)) is a

*set*

*of*substitutions that map the

*set*S

*of*terms into a

*set*

*of*terms containing at ... The symbols var,

*ground*, and share express the basic properties

*of*

*programs*, i.e. the semantics is given by means

*of*substitutions; for example, /(var(t)) is a

*set*

*of*substitutions that map ¢ into a

*set*...

« Previous

*Showing results 1 — 15 out of 303,084 results*