Filters








278,353 Hits in 5.2 sec

Integrating the Completion and the Well Founded Semantics [chapter]

Mauricio Osorio, Bharat Jayaraman
1998 Lecture Notes in Computer Science  
The three most well-known semantics for negation in the logic programming framework are Clark's completion Cla78], the stable semantics GL88], and the well-founded semantics vGRS91].  ...  Despite its computational and structural advantages, the well-founded semantics (WFS) is considered much too weak for real applications.  ...  This led to the discovery of two quite dominant approaches: the well-founded semantics (WFS) vGRS91], and the stable semantics (STABLE) GL88] .  ... 
doi:10.1007/3-540-49795-1_20 fatcat:x3wu4jvy7rbplovxzfylaj2wcy

Semantics for Active Integrity Constraints Using Approximation Fixpoint Theory

Bart Bogaerts, Luís Cruz-Filipe
2017 Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence  
This results in a new family of semantics for AICs, of which we study semantics and relationships to existing semantics. We argue that the AFT-well-founded semantics has some desirable properties.  ...  Active integrity constraints (AICs) constitute a formalism to associate with a database not just the constraints it should adhere to, but also how to fix the database in case one or more of these constraints  ...  The well-founded semantics induced by AFT can in general differ from the existing well-founded semantics for AICs, as we show in Example 3.13.  ... 
doi:10.24963/ijcai.2017/120 dblp:conf/ijcai/BogaertsC17 fatcat:64o7mmng35hr3nyaegch5wvcqu

Hybrid rules with well-founded semantics

Włodzimierz Drabent, Jan Małuszyński
2010 Knowledge and Information Systems  
It is based on the well-founded semantics of normal logic programs and inspired by ideas of Constraint Logic Programming (CLP) and constructive negation for logic programs.  ...  Soundness of the operational semantics is proven. Sufficient conditions for decidability of the declarative semantics, and for completeness of the operational semantics are given.  ...  the original author(s) and source are credited.  ... 
doi:10.1007/s10115-010-0300-5 fatcat:v7fh56bnlvbrhm47noaspvpuka

Page 4535 of Mathematical Reviews Vol. , Issue 93h [page]

1993 Mathematical Reviews  
semantics and well-founded semantics.  ...  and well-founded semantics.  ... 

Contradiction: When avoidance equals removal Part I [chapter]

José Júlio Alferes, Luís Moniz Pereira
1994 Lecture Notes in Computer Science  
and shows the equivalence between the avoidance and removal approaches. ?  ...  The work is divided into two parts: one is presented in this paper, and comprises the contradiction avoidance approach, and the other in 16] in this volume, comprises the contradiction removal approach  ...  Well Founded Semantics with Explicit Negation (WFSX) 15], which we prefer, is an extension of the Well Founded Semantics 26] to include a second negation : called explicit negation, that preserves well  ... 
doi:10.1007/3-540-58025-5_47 fatcat:ljpzshgyb5e3dbtxgqc4vacmmm

From science to e-Science to Semantic e-Science: A Heliophysics case study

Thomas Narock, Peter Fox
2012 Computers & Geosciences  
We show examples of significant reductions in time and effort enable by Semantic e-Science; yet, we argue that a "complete" solution requires integrating semantic search with other research areas such  ...  The integration of search with web services, relational databases, and other cyberinfrastructure is a central tenet of our case study and one that we believe has applicability as a generalized research  ...  The Semantic Web aids in data discovery and integration and several implementations can be found in the literature (Madin et al., 2007; Neumann, 2005; Fox et al., 2007) .  ... 
doi:10.1016/j.cageo.2011.11.018 fatcat:apgxbbnulrfspavx5vggder35e

Semantic integration and sentence perception

Sheldon Rosenberg, Robert J. Jarvella
1970 Journal of Verbal Learning and Verbal Behavior  
A mixed list of semantically well-integrated (SWI) and semantically poorly integrated (SPI) sentences (constructed from associative sentence norms) was presented for shadowing to one group of Ss under  ...  The SWI and SPI sentences were balanced for length, number, and stress of syllables, number and type of phones, noun animateness, and word frequency.  ...  Quiet and noise versions of 12 practice sentences of intermediate semantic integration and the instructions to Ss completed the experimental materials. Apparatus.  ... 
doi:10.1016/s0022-5371(70)80100-1 fatcat:wbdnsnqy2zdkrovoeff33rrpzy

A Novel Combination of Answer Set Programming with Description Logics for the Semantic Web

Thomas Lukasiewicz
2010 IEEE Transactions on Knowledge and Data Engineering  
In particular, we show that the well-founded semantics approximates the answer set semantics.  ...  We also define the well-founded semantics for the normal case, where normal programs are combined with tractable description logics, and we explore its semantic and computational properties.  ...  the well-founded semantics.  ... 
doi:10.1109/tkde.2010.111 fatcat:okrzhm37b5du3efa34rbcephpq

Editorial

Hélène Kirchner, Wolfgang Wechler
1992 Theoretical Computer Science  
In the first case, strong completion specifies stable semantics, and in the second case, well-founded semantics.  ...  This approach provides a sound and complete query-answering system with respect to the well-founded semantics of a class of programs characterized here.  ... 
doi:10.1016/0304-3975(92)90283-l fatcat:nb6jl2blyrfg3pkdq6yrch5wwi

A unifying view for logic programming with non-monotonic reasoning

Antonio Brogi, Evelina Lamma, Paolo Mancarella, Paola Mello
1997 Theoretical Computer Science  
The resulting semantics is purely model-theoretic, and gives meaning to any noncontradictory abductive logic program.  ...  Moreover, it embeds and generalizes some existing semantics which deal with negation and abduction. The framework is equipped with a correct top-down proof procedure.  ...  Acknowledgements We thank the anonymous referees for their useful and pertinent comments on the first version of this paper. This work has been partially supported by MURST 40% Project.  ... 
doi:10.1016/s0304-3975(97)80755-4 fatcat:7xvy72jhizeybildnx7w35ysqa

Page 4998 of Mathematical Reviews Vol. , Issue 96h [page]

1996 Mathematical Reviews  
(I-MILAN-I; Milan) Static semantics as program transformation and well-founded computation.  ...  performed only once, and of an efficient runtime computation, obtained as a variation of any effective procedural semantics for the well-founded model.”  ... 

Extending Prolog with nonmonotonic reasoning

Weidong Chen
1996 The Journal of Logic Programming  
Section 2 presents an implementation of the well-founded semantics of normal logic programs using tabled evaluation.  ...  The latter is based upon SLG resolution [4] , which extends OLDT resolution to handle negation and to compute the well-founded semantics of normal logic programs.  ... 
doi:10.1016/0743-1066(95)00151-4 fatcat:qxjtfwogargabg235cf4upjfyq

A Framework-based Approach for the Integration of Web-based Information Systems on the Semantic Web

Danillo R. Celino, Luana Vetter Reis, Beatriz Franco Martins, Vítor E. Silva Souza
2016 Proceedings of the 22nd Brazilian Symposium on Multimedia and the Web - Webmedia '16  
In this paper, we propose FrameWeb-LD, an approach for the integration of Web-based Information Systems on the Semantic Web, which uses well-founded languages and methods for the modeling of ontologies  ...  For the vision of the Semantic Web to become a reality and its benefits harnessed, data available on the Web must also be published in the form of linked data.  ...  The authors would like to thank Bruno Borlini Duarte for his contributions to the OntoUML model of C2D and all the students that contributed to FrameWeb-LD's evaluation.  ... 
doi:10.1145/2976796.2976847 dblp:conf/webmedia/CelinoRMS16 fatcat:cx54nfru3rfvfhxpl722b7vsw4

A Compositional Typed Higher-Order Logic with Definitions

Ingmar Dasseville, Matthias Van Der Hallen, Bart Bogaerts, Gerda Janssens, Marc Denecker, Marc Herbstritt
2016 International Conference on Logic Programming  
under a well-founded or stable semantics.  ...  The paper describes how syntax, typing and semantics of the logic are composed from the set of its language constructs.  ...  Nevertheless, standard well-founded semantics is computationally cheaper and seems easier to implement. This provides a good motivation.  ... 
doi:10.4230/oasics.iclp.2016.14 dblp:conf/iclp/DassevilleH0JD16 fatcat:syht6oy5yfhdpljjuhkwcqf5sq

Analysis of the Problem of Semantic Heterogeneity in the Integration of Railway System

Haiming Jing
2015 International Journal of Hybrid Information Technology  
conflict between the concept, properties and examples in the two ontology, finally, ontology mapping types was output and then mapping discovery process have complete.  ...  In this paper, order to adapt to the data request model of railway system, and semantic conflict type existing in the process of data integration, Ontology technology is employed in heterogeneous information  ...  mechanism can realize the initiative find of semantic conflict in the process of data integration, and accomplish the construction of semantic mapping relation by discovered semantic conflict, complete  ... 
doi:10.14257/ijhit.2015.8.1.38 fatcat:67htyvwgpvg5tmtjcpe7jcnlbq
« Previous Showing results 1 — 15 out of 278,353 results