Sciweavers

1486 search results - page 96 / 298
» A Logically Saturated Extension of
Sort
View
ICLP
2009
Springer
16 years 6 months ago
Reducts of Propositional Theories, Satisfiability Relations, and Generalizations of Semantics of Logic Programs
Over the years, the stable-model semantics has gained a position of the correct (two-valued) interpretation of default negation in programs. However, for programs with aggregates (...
Miroslaw Truszczynski
DASFAA
2009
IEEE
144views Database» more  DASFAA 2009»
16 years 19 days ago
Logical Foundations for Similarity-Based Databases
Abstract. Extensions of relational databases which aim at utilizing various aspects of similarity and imprecision in data processing are widespread in the literature. A need for de...
Radim Belohlávek, Vilém Vychodil
CORR
2010
Springer
165views Education» more  CORR 2010»
15 years 6 months ago
Cut-Elimination and Proof Search for Bi-Intuitionistic Tense Logic
We consider an extension of bi-intuitionistic logic with the traditional modalities , , and from tense logic Kt. Proof theoretically, this extension is obtained simply by extendin...
Rajeev Goré, Linda Postniece, Alwen Tiu
APN
2001
Springer
15 years 10 months ago
Rewriting Logic as a Unifying Framework for Petri Nets
We propose rewriting logic as a unifying framework for a wide range of Petri nets models. We treat in detail place/transition nets and important extensions of the basic model by in...
Mark-Oliver Stehr, José Meseguer, Peter Csa...
POPL
2006
ACM
16 years 6 months ago
A fixpoint calculus for local and global program flows
We define a new fixpoint modal logic, the visibly pushdown ?-calculus (VP-?), as an extension of the modal ?-calculus. The models of this logic are execution trees of structured p...
Rajeev Alur, Swarat Chaudhuri, P. Madhusudan