112,255 Hits in 9.7 sec

Description Logics That Count, and What They Can and Cannot Count (Extended Abstract)

Franz Baader, Filippo De Bortoli
2020 International Workshop on Description Logics  
Simple counting quantifiers that can be used to compare the number of role successors of an individual or the cardinality of a concept with a fixed natural number have been employed in Description Logics  ...  Basically, we showed there that ALCSCC ∞ concepts can go beyond first-order logic (recall the concept description succ(|r ∩ A| = |r ∩ ¬A|) mentioned earlier) and determined a sub-logic of ALCSCC ∞ , called  ... 
dblp:conf/dlog/BaaderB20 fatcat:7sloatdbcrfgzd5xlk3wxt5u6a

A Formalization and Proof of the Extended Church-Turing Thesis -Extended Abstract-

Nachum Dershowitz, Evgenia Falkovich
2012 Electronic Proceedings in Theoretical Computer Science  
We prove the Extended Church-Turing Thesis: Every effective algorithm can be efficiently simulated by a Turing machine.  ...  This is accomplished by emulating an effective algorithm via an abstract state machine, and simulating such an abstract state machine by a random access machine, representing data as a minimal term graph  ...  Introduction The Church-Turing Thesis asserts that all effectively computable numeric functions are recursive and, likewise, they can be computed by a Turing machine, or-more precisely-can be simulated  ... 
doi:10.4204/eptcs.88.6 fatcat:2gzuaxlo7jf6nlqwgudb5nuvna

Standard State Space Models of Unawareness (Extended Abstract)

Peter Fritz, Harvey Lederman
2016 Electronic Proceedings in Theoretical Computer Science  
The impossibility theorem of Dekel, Lipman and Rustichini has been thought to demonstrate that standard state-space models cannot be used to represent unawareness.  ...  We then distinguish three notions of awareness, and argue that although one of them may not be adequately modeled using standard state spaces, there is no reason to think that standard state spaces cannot  ...  In fact, the model used in the above proof of Theorem 2 can also be used to show that DLR's other two results cannot be extended either.  ... 
doi:10.4204/eptcs.215.11 fatcat:iun53y4kdvbl7dcporoggrgz6a

Abstracting abstract control

James Ian Johnson, David Van Horn
2014 Proceedings of the 10th ACM Symposium on Dynamic languages - DLS '14  
Recent advances have shown that higher-order programs can be approximated with pushdown systems.  ...  to dynamic language analysis since all that is required is a machine description of the interpreter.  ...  The basic idea is that abstract machines implement a language's concrete semantics, so we transform them slightly so that they also implement a language's abstract semantics (thus "abstracting" abstract  ... 
doi:10.1145/2661088.2661098 dblp:conf/dls/JohnsonH14 fatcat:jftogwomxjhs3ob62mihglncom

Identifying Shapes Using Self-Assembly (extended abstract) [article]

Matthew J. Patitz, Scott M. Summers
2010 arXiv   pre-print
In this paper, we introduce the following problem in the theory of algorithmic self-assembly: given an input shape as the seed of a tile-based self-assembly system, design a finite tile set that can, in  ...  Acknowledgments Both authors would like to thank Paul Rothemund and John Mayfield for helpful discussions and useful feedback.  ...  These modules are side-by-side pairs of unary counters and binary counters that do not interact with each other as they count.  ... 
arXiv:1006.3046v1 fatcat:kqs4lykx4ngnzlivjcjhevav6e

Finding New Diamonds: Temporal Minimal-World Query Answering over Sparse ABoxes (Extended Abstract)

Stefan Borgwardt, Walter Forkel, Alisa Kovtunova
2020 International Workshop on Description Logics  
Temporal Minimal-World Query Answering (Extended Abstract)  ...  Acknowledgements This work was supported by the DFG grant BA 1122/19-1 (GOASQ) and grant 389792660 (TRR 248) (see https://perspicuous-computing. science).  ...  Temporal description logics (DLs) combine terminological and temporal knowledge representation capabilities and have been investigated in detail in the last decades [2, 16, 17] .  ... 
dblp:conf/dlog/BorgwardtFK20 fatcat:77teu555ybh7bpt5ibybqz7cny

Extending abstract argumentation systems theory

P. Baroni, M. Giacomin, G. Guida
2000 Artificial Intelligence  
We extend the theory by admitting that premises can be defeated and relaxing the implicit assumption about their strength.  ...  In this paper, we extend the theory of abstract argumentation systems proposed by Vreeswijk (1997) .  ...  Acknowledgements We are indebted to the anonymous referees for their helpful comments and suggestions.  ... 
doi:10.1016/s0004-3702(00)00030-8 fatcat:gms5lgglvfchtn6yqm2z3a4pam

Lagrangian Decomposition for Classical Planning (Extended Abstract)

Florian Pommerening, Gabriele Röger, Malte Helmert, Hadrien Cambazad, Louis-Martin Rousseau, Domenico Salvagnin
2020 Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence  
This allows us to view the computation as an iterative process that can be seeded with any cost partitioning and that improves over time.  ...  In the case of non-negative cost partitioning of abstraction heuristics the computation reduces to independent shortest path problems and does not require an LP solver.  ...  This supports predictive abilities beyond what those features can provide individually and can be interpreted as using a logical conjunction 'AND' to combine these fea- tures F x (u s ) = F int (u s )×  ... 
doi:10.24963/ijcai.2020/655 dblp:conf/ijcai/0003G20 fatcat:ngkfzfxzu5afdftl2tuyo45uue

Mechanized Metatheory Revisited: An Extended Abstract (Invited Paper)

Dale Miller, Michael Wagner
2018 Types for Proofs and Programs  
, for example, de Bruijn numerals and nominal logic features.  ...  interact with the full range of logical connectives and quantifiers.  ...  rules so that coinduction can be seen as, say, the de Morgan (and T Y P E S 2 0 1 6 1:4 Mechanized Metatheory Revisited: An Extended Abstract proof theoretic) dual to induction.  ... 
doi:10.4230/lipics.types.2016.1 dblp:conf/types/Miller16 fatcat:ryflgp5aqvh4pjd7x6jff3keky

Descriptive complexity for pictures languages (extended abstract) [article]

Etienne Grandjean and Frédéric Olive and Gaétan richard
2012 arXiv   pre-print
They are obtained in a general and uniform framework that allows to extend them to other "regular" structures.  ...  Finally, we describe some hierarchy results that show the optimality of our logical characterizations and delineate their limits.  ...  Can it be dropped? The following result shows it cannot. Proposition 4.1.  ... 
arXiv:1201.5853v1 fatcat:5tv3eosk6zbb5prfkwkrsrwbge

Lost in Abstraction: Monotonicity in Multi-Threaded Programs (Extended Technical Report) [article]

Alexander Kaiser, Daniel Kroening, Thomas Wahl
2014 arXiv   pre-print
In this paper, we show that the act of obtaining finite-data thread abstractions for model checking can be at odds with monotonicity: Predicate-abstracting certain widely used monotone software results  ...  We demonstrate how the abstract programs can be modified into monotone ones, without affecting safety properties of the non-monotone abstraction.  ...  As a result, their technique cannot be extended to unbounded thread counts with well quasi-ordered systems technology.  ... 
arXiv:1406.5715v2 fatcat:necrlavcqvhujblmquutt5x3dq

Paxos Consensus, Deconstructed and Abstracted (Extended Version) [article]

Álvaro García-Pérez, Alexey Gotsman, Yuri Meshman, Ilya Sergey
2018 arXiv   pre-print
We provide novel non-deterministic specifications for each module in the deconstruction and prove that the implementations refine the corresponding specifications, such that the proofs of the modules that  ...  remain unchanged can be reused across different implementations.  ...  This work by was supported by ERC Starting Grant H2020-EU 714729 and EPSRC First Grant EP/P009271/1.  ... 
arXiv:1802.05969v1 fatcat:roxatjzdcfczhim6elusi26aoi

Automated Conjecturing I: Fajtlowicz's Dalmatian Heuristic Revisited (Extended Abstract)

Craig E. Larson, Nico Van Cleemput
2017 Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence  
In the 1950s Newell and Simon developed the Logic Theorist program that could prove (some) theorems in first-order logic, and went on to predict that a computer would discover and prove an important mathematical  ...  Development of a program that contributes to scientific discoveries requires knowing what counts as a contribution to scientific discovery; a successful discovery program must make such a contribution.  ... 
doi:10.24963/ijcai.2017/713 dblp:conf/ijcai/LarsonC17 fatcat:iljdbdn3zjdrflobqdbzykocl4

Go with the Flow: Compositional Abstractions for Concurrent Data Structures (Extended Version) [article]

Siddharth Krishna, Dennis Shasha, Thomas Wies
2017 arXiv   pre-print
These proofs cannot be easily expressed using the abstraction mechanisms provided by existing separation logics.  ...  To demonstrate the versatility of our approach, we show how to extend the logic RGSep with flow interfaces.  ...  The logic can be easily extended to ϕ[_] ∃v. ϕ[v] v fresh in ϕ ϕ[I In ] ∃In.  ... 
arXiv:1711.03272v1 fatcat:2auym4ftbfgmbeq6fscsaqvyxa

Some Programming Languages Suggested by Game Models (Extended Abstract)

John Longley
2009 Electronical Notes in Theoretical Computer Science  
We consider a simple and well-known category of alternating games (also known as sequential data structures) and several categories derived from it.  ...  The quest for such languages results in a novel selection of language primitives for state encapsulation, coroutining and backtracking.  ...  we ask what programming languages might correspond to them (in the sense of full abstraction and definability).  ... 
doi:10.1016/j.entcs.2009.07.087 fatcat:ayy7zyab6ndqrbmnkj6wkl4nlu
« Previous Showing results 1 — 15 out of 112,255 results