53,142 Hits in 6.3 sec

The Web Service Modeling Language WSML: An Overview [chapter]

Jos de Bruijn, Holger Lausen, Axel Polleres, Dieter Fensel
2006 Lecture Notes in Computer Science  
This core language is extended in the directions of Description Logics and Logic Programming in a principled manner with strict layering.  ...  WSML distinguishes between conceptual and logical modeling in order to support users who are not familiar with formal logic, while not restricting the expressive power of the language for the expert user  ...  WSML-Rule extends WSML-Flight with further features from Logic Programming, namely the use of function symbols, unsafe rules and unstratified negation under the Well-Founded semantics.  ... 
doi:10.1007/11762256_43 fatcat:ae5ffg45lffhzjmgcwfjzhnxz4

Nonmonotonic Ontological and Rule-Based Reasoning with Extended Conceptual Logic Programs [chapter]

Stijn Heymans, Davy Van Nieuwenborgh, Dirk Vermeir
2005 Lecture Notes in Computer Science  
We present extended conceptual logic programs (ECLPs), for which reasoning is decidable and, moreover, can be reduced to finite answer set programming.  ...  ECLPs are useful to reason with both ontological and rule-based knowledge, which is illustrated by simulating reasoning in an expressive description logic (DL) equipped with DL-safe rules.  ...  Conclusions and Directions for Further Research We extended CLPs with a finite set of arbitrary ground DLP rules, and showed that reasoning with the resulting ECLPs can be reduced to finite answer set  ... 
doi:10.1007/11431053_27 fatcat:q6wev733pjhv7inota6sv6pmyy

Integrating Description Logics and Answer Set Programming [chapter]

Stijn Heymans, Dirk Vermeir
2003 Lecture Notes in Computer Science  
The extended language, conceptual logic programming (CLP) proves to be a viable alternative for intuitively representing and reasoning nonmonotonically, in a decidable way, with possibly infinite knowledge  ...  Not only can conceptual logic programs (CLPs) simulate finite answer set programming, they are also flexible enough to simulate reasoning in an expressive class of description logics, thus being able to  ...  Finally, we intend to confirm the theoretical results with an implementation of CLP.  ... 
doi:10.1007/978-3-540-24572-8_10 fatcat:poaqc5ie55fgdc3k3k3ga6lhfi

Querying Formal Contexts with Answer Set Programs [chapter]

Pascal Hitzler, Markus Krötzsch
2006 Lecture Notes in Computer Science  
Recent studies showed how a seamless integration of formal concept analysis (FCA), logic of domains, and answer set programming (ASP) can be achieved.  ...  Based on these results for combining hierarchical knowledge with classical rule-based formalisms, we introduce an expressive common-sense query language for formal contexts.  ...  Thus, let P denote an extended disjunctive logic program in which Neg(r) is empty for each ASP-rule r ∈ P .  ... 
doi:10.1007/11787181_19 fatcat:xwgddh6ncbhepdcuhh6ei3pl5u

Logic programs for intelligent web search [chapter]

Bernd Thomas
1999 Lecture Notes in Computer Science  
We give a formal definition for the semantics of logic programs extended by token-templates and define a general answer-complete calculus for these extended programs.  ...  By using token-templates in conjunction with logic programs we are able to reason about web page contents, search and collect facts and derive new facts from various web pages.  ...  Next the definition of a general calculus for extended logic programs based on an arbitrary sound and answer complete calculus is given.  ... 
doi:10.1007/bfb0095104 fatcat:3y25tiznevaw7mu2avh7j6vs5y

Semantic Web Reasoning with Conceptual Logic Programs [chapter]

Stijn Heymans, Davy Van Nieuwenborgh, Dirk Vermeir
2004 Lecture Notes in Computer Science  
Reasoning with the resulting Conceptual Logic Programs can be reduced to finite, normal Answer Set Programming, for which reasoners are available.  ...  We argue that Conceptual Logic Programming is a useful tool for uniformly representing and reasoning with both ontologies and rules on the Semantic Web, as they can capture a large fragment of the OWL  ...  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.  ... 
doi:10.1007/978-3-540-30504-0_9 fatcat:lcsryatlbrgjrnqfa5ucndphxu

Open answer set programming for the semantic web

Stijn Heymans, Davy Van Nieuwenborgh, Dirk Vermeir
2007 Journal of Applied Logic  
for logic programming paradigms) and the use of open domains, one of the key features for conceptual modeling, as present in classical logics.  ...  Reasoning with the resulting extended forest logic programs (EFoLPs) can be reduced to finite answer set programming, for which reasoners are available.  ...  This was remedied by syntactically restricting the types of allowed rules in logic programs, resulting in extended forest logic programs.  ... 
doi:10.1016/j.jal.2006.02.001 fatcat:iida6eh32batzlpksmbnfcfpjy

Effective support of databases with ontological dependencies: Relational languages instead of description logics

L. A. Kalinichenko
2012 Programming and computer software  
compared to the description logics.  ...  The main part of the paper is devoted to the survey of the development of relational database languages providing broader and more efficient support of queries over databases with the ontological dependencies  ...  work was supported in part by the Russian Foundation for Basic Research (project nos. 10 07 00342 a and 11 07 00402 a) and by the Presidium of the Russian Academy of Sciences (the fundamental research program  ... 
doi:10.1134/s0361768812060059 fatcat:aezozh4o6rctjft47p3uny4lnm

Personal knowledge base designer: Software for expert systems prototyping

Aleksandr Yu. Yurin, Nikita O. Dorodnykh
2020 SoftwareX  
The core of the new software is a unified model for representing and editing knowledge in the form of logical rules, as well as its interpretation using the built-in rule engine.  ...  We present a new software with similar properties.  ...  The contribution on a TabbyXL's integration (Section 3.2) and empirical results connected with spreadsheets transformations (Section 4) was supported by the Russian Science Foundation (Grant no. 18-71-  ... 
doi:10.1016/j.softx.2020.100411 fatcat:nmbxjhlm5valzkqis4qm5z6b3m

On Representational Issues About Combinations of Classical Theories with Nonmonotonic Rules [chapter]

Jos de Bruijn, Thomas Eiter, Axel Polleres, Hans Tompits
2006 Lecture Notes in Computer Science  
rule languages rooted in logic programming is receiving considerable attention.  ...  Existing approaches such as SWRL, dl-programs, and DL+log, differ significantly in the way ontologies interact with (nonmonotonic) rules bases.  ...  [HNV05] uses extended conceptual logic programs to reason with expressive description logics combined with DL-safe rules.  ... 
doi:10.1007/11811220_1 fatcat:p3kdmphjz5hhtotgthfuvdofv4

Guarded Hybrid Knowledge Bases [article]

Stijn Heymans, Jos de Bruijn, Livia Predoiu, Cristina Feier, Davy Van Nieuwenborgh
2007 arXiv   pre-print
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  ...  that consist of a Description Logic knowledge base and a guarded logic program, similar to the DL+log knowledge bases from (Rosati 2006).  ...  Nonmonotonic Ontological and Rule-Based Reasoning with Extended Conceptual Logic Programs. In Proc. of ESWC 2005. Number 3532 in LNCS. Springer, 392-407.  ... 
arXiv:0711.2155v1 fatcat:vteqertlzbhpzmfjb32wdl5muu

Representing Dynamic Invariants in Ontologically Well-Founded Conceptual Models [chapter]

John Guerson, João Paulo Almeida
2016 Lecture Notes in Business Information Processing  
Conceptual models often capture the invariant aspects of the phenomena we perceive.  ...  It enriches the ontologically well-founded OntoUML profile and enables the expression of a variety of (arbitrary) temporal constraints.  ...  For example, some have extended OCL with Linear-Temporal Logic and Computational-Tree logic (LTL/CTL) operators [3, 7, 19, 27] , created new logic formalisms [4, 9] , extended OCL with temporal patterns  ... 
doi:10.1007/978-3-319-39429-9_19 fatcat:rc7eezzravb2fkb3szbng6byya

Page 2772 of Mathematical Reviews Vol. , Issue 99d [page]

1991 Mathematical Reviews  
The classical rules and axioms of first order logic with equality are sound. In addition, some rules and axioms are needed for the ready relation and other object operators considered.  ...  of first order logic.  ... 

From Functional Logic Programs to Purely Functional Programs Preserving Laziness [chapter]

Bernd Braßel, Sebastian Fischer
2011 Lecture Notes in Computer Science  
Functional logic languages extend the setting of functional programming by non-deterministic choices, free variables and narrowing.  ...  The impact of this reduction is a general scheme for compiling functional logic programs to lazy functional programs without side effects.  ...  Similar to the special rules for Choice, every pattern matching needs to be extended with a rule for Failure.  ... 
doi:10.1007/978-3-642-24452-0_2 fatcat:puky3uofxjfxrfxjdigrxwylgq

Partial Models of Extended Generalized Logic Programs [chapter]

José J. Alferes, Heinrich Herre, Luís Moniz Pereira
2000 Lecture Notes in Computer Science  
The presented preference criterion de nes a partial model of an extended generalized logic program as intended if it is generated by a stationary chain.  ...  In the present paper a general preference criterion is proposed that selects the'intended' partial models of extended generalized logic programs which is a conservative extension of the stationary semantics  ...  programs, and EGLP to extended generalized logic programs.  ... 
doi:10.1007/3-540-44957-4_10 fatcat:m7rojvsfsnetdcn54fmdhg2oem
« Previous Showing results 1 — 15 out of 53,142 results