LOPSTR 2009 - PDF Preprint Papers

LOPSTR 2009 Logic Program Synthesis and Transformation

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed LOPSTR-2009 Paper

click to vote

LOPSTR
2009
Springer

114views Automated Reasoning» more LOPSTR 2009»

Coinductive Logic Programming with Negation

1 years 12 months ago

Download www.utdallas.edu

Answer Set Programming (ASP) is a powerful paradigm of logic programming for non-monotonic reasoning. However, the restriction of “grounded range-restricted function-free normal ...

Richard Min, Gopal Gupta

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status
1	114	Coinductive Logic Programming with Negation	claim
2	97	Towards Scalable Partial Evaluation of Declarative Programs	claim
3	81	The Dependency Triple Framework for Termination of Logic Programs	claim
4	79	Defining Datalog in Rewriting Logic	claim
5	79	A Transformational Approach for Proving Properties of the CHR Constraint Store	claim
6	76	LP with Flexible Grouping and Aggregates Using Modes	claim
7	74	Using Rewrite Strategies for Testing BUpL Agents	claim
8	67	Towards a Framework for Constraint-Based Test Case Generation	claim
9	67	Goal-Directed and Relative Dependency Pairs for Proving the Termination of Narrowing	claim
10	62	Towards Just-In-Time Partial Evaluation of Prolog	claim
11	61	Deciding Full Branching Time Logic by Program Transformation	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers