33,430 Hits in 3.7 sec

Clingo = ASP + Control: Preliminary Report [article]

Martin Gebser, Roland Kaminski, Benjamin Kaufmann, Torsten Schaub
2014 arXiv   pre-print
goes well beyond the advanced yet still rigid solving processes of the latter.  ...  On the declarative side, clingo 4 offers a new directive that allows for structuring logic programs into named and parameterizable subprograms.  ...  Introduction Standard Answer Set Programming (ASP; (Baral 2003) ) follows a one-shot process in computing stable models of logic programs.  ... 
arXiv:1405.3694v1 fatcat:vugrlddllzhkzedgrqgagymdl4

LambdaDL: Syntax and Semantics (Preliminary Report) [article]

Martin Leinberger and Ralf Lämmel and Steffen Staab
2016 arXiv   pre-print
The paper motivates the use of a modified type system for semantic data and it provides the theoretic foundation for the integration of description logics as well as the core formal specifications of λ_DL  ...  This is achieved by the integration of description logics into the λ-calculus for typing and data access. It is centered around several key design principles.  ...  extensions or custom languages.  ... 
arXiv:1610.07033v1 fatcat:pqwje2g2svdmxh33olhbjg74zq

Preliminary Report on WASP 2.0 [article]

Mario Alviano, Carmine Dodaro, Francesco Ricca
2014 arXiv   pre-print
A preliminary experiment on benchmarks from the 3rd ASP competition belonging to the NP class is reported.  ...  This paper reports on the recent improvements of the ASP solver WASP. WASP is undergoing a refactoring process which will end up in the release of a new and more performant version of the software.  ...  We also report on a preliminary experiment in which we compare the old and new versions of WASP with the latest version of clasp, which is the solver that won the 3rd and 4th edition of the ASP competition  ... 
arXiv:1404.6999v1 fatcat:3pdym5d6jbc47maz6srrckqr44

Transfer of semantics from argumentation frameworks to logic programming A preliminary report [article]

Monika Adamova, Jan Sefranek
2011 arXiv   pre-print
The construction enables to transfer each semantics of the resulting argumentation framework to a semantics of the given logic program.  ...  Our main motivation is to transfer semantics' proposed by Baroni, Giacomin and Guida for argumetation frameworks with odd-length cycles to logic programs with odd-length cycles through default negation  ...  This paper was supported by the grant 1/0689/10 of VEGA.  ... 
arXiv:1108.5281v1 fatcat:6uaif5yrvjahffygcz52iuyvmm

A Consistency-Based Model for Belief Change: Preliminary Report [article]

James Delgrande, Torsten Schaub
2000 arXiv   pre-print
There may be more than one way in which A can be so extended by K: in choice revision, one such "extension" represents the revised state; alternately revision consists of the intersection of all such extensions  ...  The most general formulation of our approach is flexible enough to express other approaches to revision and update, the merging of knowledge bases, and the incorporation of static and dynamic integrity  ...  Formal Preliminaries We deal with propositional languages and use the logical symbols ⊤, ⊥, ¬, ∨, ∧, ⊃, and ≡ to construct formulas in the standard way.  ... 
arXiv:cs/0003052v3 fatcat:nvaukn5jlrekvida7hcy7jdoxe

The Fourth Answer Set Programming Competition: Preliminary Report [chapter]

Mario Alviano, Francesco Calimeri, Günther Charwat, Minh Dao-Tran, Carmine Dodaro, Giovambattista Ianni, Thomas Krennwallner, Martin Kronegger, Johannes Oetsch, Andreas Pfandler, Jörg Pührer, Christoph Redl (+6 others)
2013 Lecture Notes in Computer Science  
Participants competed on a selected collection of benchmark problems, taken from a variety of research areas and real world applications.  ...  The fourth ASP Competition, held in 2012/2013, is the sequel to previous editions and it was jointly organized by University of Calabria (Italy) and the Vienna University of Technology (Austria).  ...  , the Knowledge-based Systems Group, and the Theory and Logic Group of Vienna University of Technology (TU Vienna), as well as the Computer Science Group at the Department of Mathematics and Computer Science  ... 
doi:10.1007/978-3-642-40564-8_5 fatcat:g2cowroefzantc4pubqeyzykii

Coherent choice and epistemic entrenchment (preliminary report) [chapter]

Hans Rott
1994 Lecture Notes in Computer Science  
This paper offers a systematic justification of the postulates for entrenchment by interpreting entrenchment in terms of the general theory of rational choice.  ...  Belief revision has recently been modelled with the help of the notion of epistemic entrenchment (G~rdenfors and Makinson, TARK 1988, and Rott, JoLLI 1992).  ...  and did not study the implications of criteria of rational choice for the logic of belief change.  ... 
doi:10.1007/3-540-58467-6_25 fatcat:oohkf2ns25gl3gh2qztmhs22sq

Dialectical proof theory for defeasible argumentation with defeasible priorities (preliminary report) [chapter]

Henry Prakken
1999 Lecture Notes in Computer Science  
In this paper a dialectical proof theory is proposed for logical systems for defeasible argumentation that t a certain format.  ...  The proof theory could serve as the'logical core' of protocols for dispute in multi-agent decision making processes.  ...  of negation as failure, and in default logic because of the justi cation part of defaults.)  ... 
doi:10.1007/3-540-46581-2_14 fatcat:azbw7a5s7jdtnj6r2jriqk6qmi

LoIDE: a web-based IDE for Logic Programming - Preliminary Technical Report [article]

Stefano Germano, Francesco Calimeri, Eliana Palermiti
2017 arXiv   pre-print
Logic-based paradigms are nowadays widely used in many different fields, also thank to the availability of robust tools and systems that allow the development of real-world and industrial applications.  ...  In this work we present LoIDE, an advanced and modular web-editor for logic-based languages that also integrates with state-of-the-art solvers.  ...  We are working to support more executors (web-services), logic-based languages and solvers (engines), in order to increase the audience of the project; the addition of an interactive tutorial could also  ... 
arXiv:1709.05341v1 fatcat:zbcdpvqtwzerbcit3tigh6xhye

Preferred well-founded semantics for logic programming by alternating fixpoints: Preliminary report [article]

Torsten Schaub, Kewen Wang
2002 arXiv   pre-print
We analyze the problem of defining well-founded semantics for ordered logic programs within a general framework based on alternating fixpoint theory.  ...  We start by showing that generalizations of existing answer set approaches to preference are too weak in the setting of well-founded semantics.  ...  default logic [3, 5] .  ... 
arXiv:cs/0207060v1 fatcat:rjrtsi5uhrgebnstaom7bezrgi

Encoding RTL Constructs for MathSAT: a Preliminary Report

Marco Bozzano, Roberto Bruttomesso, Alessandro Cimatti, Anders Franzén, Ziyad Hanna, Zurab Khasidashvili, Amit Palti, Roberto Sebastiani
2006 Electronical Notes in Theoretical Computer Science  
atoms in the theories of equality and uninterpreted functions (¦ § © ), difference logic ( ), linear arithmetic on the Reals ( !  ...  Tools for formal checking are thus confronted with problems which are "flattened" down to boolean level, so that a predominant part of their computational effort is wasted in performing useless boolean  ...  We have used MATH-SAT version 3.2.1 with the default options.  ... 
doi:10.1016/j.entcs.2005.12.001 fatcat:iy665jfd65aodldl55kkuf7qfq

A Core Language for Executable Models of Cyber-Physical Systems (Preliminary Report)

Walid Taha, Paul Brauner, Yingfu Zeng, Robert Cartwright, Veronica Gaspes, Aaron Ames, Alexandre Chapoutot
2012 2012 32nd International Conference on Distributed Computing Systems Workshops  
By focusing on the expressivity of equations formed from continuous functions, this work did not accommodate a wide range of discrete behaviors or a dynamic collection of components.  ...  This paper gives an overview of a proposed core language for capturing executable hybrid models of highly dynamic cyber-physical systems.  ...  We hope to report on and address these issues in an extended version of this paper. V.  ... 
doi:10.1109/icdcsw.2012.72 dblp:conf/icdcsw/TahaBZCGAC12 fatcat:jrcddhcz3fe75pq5nq4u6ouhqi

The SeaLion has Landed: An IDE for Answer-Set Programming---Preliminary Report [article]

Johannes Oetsch and Jörg Pührer and Hans Tompits
2011 arXiv   pre-print
SeaLion comes as a plugin of the popular Eclipse platform and provides itself interfaces for future extensions of the IDE.  ...  We report about the current state and designated features of the tool SeaLion, aimed to serve as an integrated development environment (IDE) for answer-set programming (ASP).  ...  Introduction Answer-set programming (ASP) is a well-known and fully declarative problem-solving paradigm based on the idea that solutions to computational problems are represented in terms of logic programs  ... 
arXiv:1109.3989v2 fatcat:hngalryshnbi5b6y3havt6yuqm

Integrating Rules and Ontologies in the First-Order Stable Model Semantics (Preliminary Report) [chapter]

Joohyung Lee, Ravi Palla
2011 Lecture Notes in Computer Science  
We present an approach to integrating rules and ontologies on the basis of the first-order stable model semantics defined by Ferraris, Lee and Lifschitz.  ...  The two variants of F * above are syntactic counterparts of these definitions of QHT models. 3 The extension is similar to the extension of first-order formulas to allow aggregate expressions as given  ...  Recent work on the first-order stable model semantics helps us in studying the semantic properties and computational aspects of the hybrid KBs.  ... 
doi:10.1007/978-3-642-20895-9_27 fatcat:rqk3dwy5ynfftcysafcdljneei

A Sheaf Model of Contradictions and Disagreements. Preliminary Report and Discussion [article]

Wlodek Zadrozny, Luciana Garbayo
2018 arXiv   pre-print
Degrees of disagreement are measured by the existence of global and local sections.  ...  on these partial orders with products of lattices as stalks.  ...  Acknowledgments: We would like to thank the referees for their comments, and for suggesting connections to methods of resolving contradictions in knowledge bases and to scalar implicature.  ... 
arXiv:1801.09036v1 fatcat:m5ayjurdjzgddgbilh3mxu6nuu
« Previous Showing results 1 — 15 out of 33,430 results