Filters








820 Hits in 8.1 sec

Stable-Unstable Semantics: Beyond NP with Normal Logic Programs [article]

Bart Bogaerts and Tomi Janhunen and Shahab Tasharrofi
2016 arXiv   pre-print
We develop so-called combined logic programs in which oracles are directly cast as (normal) logic programs themselves.  ...  Tackling search problems beyond NP using ASP is less straightforward.  ...  Tackling search problems beyond NP with ASP requires one to use more expressive logic programs than the normal ones.  ... 
arXiv:1608.01835v3 fatcat:nmumdiznxzd5fcaiskgxnw7njq

Stable-unstable semantics: Beyond NP with normal logic programs

BART BOGAERTS, TOMI JANHUNEN, SHAHAB TASHARROFI
2016 Theory and Practice of Logic Programming  
Tackling search problems beyond NP using ASP is less straightforward.  ...  We develop so-calledcombined logic programsin which oracles are directly cast as (normal) logic programs themselves.  ...  Stable-unstable semantics: beyond NP with normal logic programs 2007) , product configuration (Tiihonen et al. 2003) , decision support for the Space Shuttle (Nogueira et al. 2001 ), e-Tourism (Ricca  ... 
doi:10.1017/s1471068416000387 fatcat:fyreor3kr5b2bpwx5xnwlii3aq

Mass nouns, vagueness and semantic variation

Gennaro Chierchia
2009 Synthese  
The outcome (besides shedding light on semantic variation) seems to suggest that vagueness is not just an interface phenomenon that arises in the interaction of Universal Grammar (UG) with the Conceptual  ...  I make it precise relying on supervaluations (more specifically, 'data semantics') to model it.  ...  Such a parametric approach has to deal with a host of issues in the syntax and semantics of Noun Phrases (NPs) that are as of yet not fully understood.  ... 
doi:10.1007/s11229-009-9686-6 fatcat:3gnnatllwjhw3jbqgxaecfrc74

Beyond NP: Quantifying over Answer Sets

GIOVANNI AMENDOLA, FRANCESCO RICCA, MIROSLAW TRUSZCZYNSKI
2019 Theory and Practice of Logic Programming  
AbstractAnswer Set Programming (ASP) is a logic programming paradigm featuring a purely declarative language with comparatively high modeling capabilities.  ...  Inspired by the way Quantified Boolean Formulas extend SAT formulas to model problems beyond NP, we propose an extension of ASP that introduces quantifiers over stable models of programs.  ...  P 1 and P 2 are normal logic programs, such that Ψ is valid iff P admits stable unstable models.  ... 
doi:10.1017/s1471068419000140 fatcat:4qqq6r7nanaixoxbp4jjahanpy

PM4SWS: A P2P Model for Semantic Web Services Discovery and Composition

Mohamed Gharzouli, Mahmoud Boufaida
2011 Journal of Advances in Information Technology  
With the capability of presenting statement semantics formally, the Hoare logic therefore offers a powerful means to describe a programming problem in a machineunderstandable way which allows automatic  ...  Axiomatic Problem Description Axiomatic semantic is closely based on Hoare logic [34], which gives axioms and inference rules for imperative programming languages.  ...  We replace each such group with a single "supercandidate".  ... 
doi:10.4304/jait.2.1.15-26 fatcat:zp7qlmgxavct5g75oex7taxl7e

Introduction to the 32nd International Conference on Logic Programming Special Issue

MANUEL CARRO, ANDY KING
2016 Theory and Practice of Logic Programming  
It seems fitting to hold a significant, power of two, ICLP in New York because the city has a long and distinguished association with logic programming: XSB was developed at Stony Brook, as was HiLog before  ...  New York has also been (and is) the cradle of several start-ups based on logic programming.  ...  Finally, we would like to thank our generous sponsors: LogicBlox Inc., Semantic Systems, The University of Texas at Dallas and, of course, the Association for Logic Programming.  ... 
doi:10.1017/s1471068416000491 fatcat:qzindp2mnbbk3p54666cwmebee

Answer Set Programming: A Primer [chapter]

Thomas Eiter, Giovambattista Ianni, Thomas Krennwallner
2009 Lecture Notes in Computer Science  
This article is a gentle introduction to the subject; it starts with motivation and follows the historical development of the challenge of defining a semantics for logic programs with negation.  ...  Answer Set Programming (ASP) is a declarative problem solving paradigm, rooted in Logic Programming and Nonmonotonic Reasoning, which has been gaining increasing attention during the last years.  ...  Note that extended logic programs have similar properties as normal logic programs under stable models semantics.  ... 
doi:10.1007/978-3-642-03754-2_2 fatcat:au2bnpvk25awbja73itqqex5ni

Automated discovery and integration of semantic urban data streams: The ACEIS middleware

Feng Gao, Muhammad Intizar Ali, Edward Curry, Alessandra Mileo
2017 Future generations computer systems  
of the event patterns in CES and compare it with the query semantics of semantic event processing systems to ensure a correct query transformation and evaluation (Section 6).  ...  . • We define the formal semantics of the event in CES and align it with RSP semantics. • We implement a query transformation system to create RSP queries from CES annotations. • We show the usage of ACEIS  ...  In this way, composing web services based on the semantics of IO messages are made possible. However, it does not go beyond providing semantics to the service interface.  ... 
doi:10.1016/j.future.2017.03.002 fatcat:tfez3loxbjaxzl5fvqrponsyma

Book reports

2005 Computers and Mathematics with Applications  
Computers and Mathematics with Applications 49 (2005) 1585-1622 www.elsevier.com/locate/camwa BOOK REPORTS The Book Reports section is a regular feature of Computers ~ Mathematics with Applications.  ...  propositional logic. 1.4.4 Completeness of propositional logic. 1.5 Normal forms. 1.5.1 Semantic equivalence, satisfiability and validity. 1.5.2 Conjunctive normal forms and validity. 1.5.3 Horn clauses  ...  logic. 2.3.1 Natural deduction rules. 2.3.2 Quantifier equivalences. 2.4 Semantics of predicate logic. 2.4.1 Models. 2.4.2 Semantic entailment. 2.4.3 The semantics of equality. 2.5 Undecidability of predicate  ... 
doi:10.1016/j.camwa.2005.04.001 fatcat:melc2iqigrh6tn37ldct5k73jm

Determinants of semantic web technology adoption from IT professionals' perspective: Industry competition, organization innovativeness, and data management capability

Quang-Thanh Ngo, Ngoc-Bien Tao
2020 International Journal of Data and Network Science  
The size and complexity of large and diverse data sources in semantic analysis, organization and interpretation from the help of machines are fast growing on the extent of human direct understanding with  ...  Semantic Web technology has the potential in data integration and has become an important means of solving big data technology.  ...  program!  ... 
doi:10.5267/j.ijdns.2020.6.005 fatcat:v2bgjhlxgbhe3fjjn3fzhwaj2a

Semi-equilibrium models for paracoherent answer set programs

Giovanni Amendola, Thomas Eiter, Michael Fink, Nicola Leone, João Moura
2016 Artificial Intelligence  
The answer set semantics may assign a logic program no model, due to logical contradiction or unstable negation, which is caused by cyclic dependency of an atom from its negation.  ...  This is at the basis of the semi-stable model semantics, which was defined using a program transformation.  ...  We are grateful to Diemar Seipel for pointing us to his work on evidential stable models.  ... 
doi:10.1016/j.artint.2016.01.011 fatcat:kgyijjxvanawfpqmmfvnn34v6e

Reasoning with infinite stable models

Piero A. Bonatti
2004 Artificial Intelligence  
They are a class of normal logic programs whose consequences under the stable model semantics can be effectively computed, despite the fact that finitary programs admit function symbols (hence infinite  ...  This paper illustrates extensively the theoretical properties, the implementation issues, and the programming style underlying finitary programs.  ...  Stimulating conversations with Michael Gelfond and Mirek Truszczyński contributed to the growth of this work.  ... 
doi:10.1016/j.artint.2004.02.001 fatcat:sfccg7lmfbaqzkvtt4eerkcsdi

Constructional change in Old and Middle English Copular Constructions and its impact on the lexicon

Peter Petré, Hubert Cuyckens
2009 Folia Linguistica Historica  
, with the archaisization of weorðan as a result.  ...  We further argue that schematic Copular Constructions emerge in overlapping usage areas resulting from these developments, in which abstraction is made of the Copulas' particular aspectual semantics.  ...  the meaning 'is called NP' (is nemned NP, is cweden NP, …) (17.3% overall, as compared to a mere 4.6% with beon).  ... 
doi:10.1515/flih.2009.005 fatcat:mdadqrydpjad3eewm7ydje64fe

On Rugina's system of thought

Florentin Smarandache
2018 Figshare  
Leon Walras's Economics of Stable Equilibrium and Keynes'sEconomics of Disequilibrium are combined in Rugina's orientation table in systems which are s percent stable and 100 ÿ s percent unstable, where  ...  Classical logic and modern logic are united in Rugina's integrated logic, and then generalized in neutrosophic logic.  ...  percent unstable); (4) Model M 4 (which is 50 percent stable, and 50 percent unstable); (5) Model M 5 (which is 35 percent stable, and 65 percent unstable); (6) Model M 6 (which is 5 percent stable, and  ... 
doi:10.6084/m9.figshare.7048532 fatcat:rq3rcdsigrecra3gaut6kckd4q

Very Hard Electoral Control Problems

Zack Fitzsimmons, Edith Hemaspaandra, Alexander Hoover, David E. Narváez
2019 PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE  
However, answer set programming is suited to express problems in ∑p2, and we present an encoding for Kemeny control.  ...  It is important to understand how the outcome of an election can be modified by an agent with control over the structure of the election.  ...  The framework of stable-unstable semantics by Bogaerts et al. (2016) provides a similar "guess and check" strategy for solving problems in Σ p 2 .  ... 
doi:10.1609/aaai.v33i01.33011933 fatcat:6bascv7a2fgzriepfqrkf62i5u
« Previous Showing results 1 — 15 out of 820 results