30,076 Hits in 4.8 sec

Learning Probabilistic Logic Models from Probabilistic Examples (Extended Abstract) [chapter]

Jianzhong Chen, Stephen Muggleton, José Santos
Inductive Logic Programming  
The ILP approach learned logic models from non-probabilistic examples.  ...  logic models from probabilistic examples.  ...  Acknowledgement The third author would like to acknowledge the funding from Wellcome Trust for his PhD program.  ... 
doi:10.1007/978-3-540-78469-2_3 dblp:conf/ilp/ChenMS07 fatcat:3iy6kxkmsjamxicjahruzf46oe

Predicting Strategic Behavior from Free Text (Extended Abstract)

Omer Ben-Porat, Lital Kuchy, Sharon Hirsch, Guy Elad, Roi Reichart, Moshe Tennenholtz
2020 Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence  
Particularly, we introduce the following question: can free text expressed in natural language serve for the prediction of action selection in an economic context, modeled as a game?  ...  Prominent examples in StarAI are ProbLog (from the directed side) and MLNs (from the undirected one).  ...  Moreover, it "only" extends Boolean logic with probabilities, thus it preserves the original logical semantics.  ... 
doi:10.24963/ijcai.2020/688 dblp:conf/ijcai/RaedtDMM20 fatcat:kbp4p2slsrculnqg2ig2dvchde

The Probabilistic Model Checker Storm (Extended Abstract) [article]

Christian Dehnert, Sebastian Junges, Joost-Pieter Katoen, Matthias Volk
2016 arXiv   pre-print
This extended abstract gives a brief overview of the features of Storm.  ...  We present a new probabilistic model checker Storm. Using state-of-the-art libraries, we aim for both high performance and versatility.  ...  The main focus of our tool is probabilistic branching time logics, i.e. PCTL [18] and CSL [19] for discrete-time and continuous-time models, respectively.  ... 
arXiv:1610.08713v1 fatcat:f56g2qs4lbad5lzys43zciol6y

Stratified Knowledge Bases as Interpretable Probabilistic Models (Extended Abstract) [article]

Ondrej Kuzelka, Jesse Davis, Steven Schockaert
2016 arXiv   pre-print
In this paper, we advocate the use of stratified logical theories for representing probabilistic models.  ...  Among others, this allows for the use of domain experts to improve learned models by directly removing, adding, or modifying logical formulas.  ...  Logical encoding of density estimation trees We can straightforwardly transform a density estimation tree into a weighted logical theory, containing one formula for each branch of the tree.  ... 
arXiv:1611.06174v1 fatcat:cwv5wmxe4vgvvlhk73qq3rsmvi

Structured Production System (extended abstract) [article]

Yi Zhou
2017 arXiv   pre-print
In this extended abstract, we propose Structured Production Systems (SPS), which extend traditional production systems with well-formed syntactic structures.  ...  Also, many fundamental approaches in computer science, including automata, grammar and logic, can be captured by structured production systems.  ...  , automata, abstract rewriting systems, logic axiom systems and so on.  ... 
arXiv:1704.07950v1 fatcat:ne2grjwllndttoo33fisoloh7i

Higher-Order Languages: Bisimulation and Coinductive Equivalences (Extended Abstract) [chapter]

Davide Sangiorgi
2014 Lecture Notes in Computer Science  
., generative names, store, data abstraction), concurrency, and so on.  ...  To be useful, the behavioral relation resulting from bisimulationbisimilarity-should be a congruence. Bisimulation has been transplanted onto higher-order languages by Abramsky [Abr90].  ...  Probabilistic models are more and more pervasive.  ... 
doi:10.1007/978-3-662-44124-4_1 fatcat:jmcahmpdejauveabvhsxrftwgy

Undecidable Cases of Model Checking Probabilistic Temporal-Epistemic Logic (Extended Abstract)

R van der Meyden, M K Patra
2016 Electronic Proceedings in Theoretical Computer Science  
We show that two distinct extensions of this logic make model checking undecidable.  ...  In particular, for a synchronous perfect recall, a generalization from temporal operators with finite reach to operators with infinite reach renders model checking undecidable.  ...  For example, in computer security, one often wants to say that the adversary A does not learn anything about a secret from watching an exchange between two parties.  ... 
doi:10.4204/eptcs.215.19 fatcat:ntw5fzc7uve3nonf2cz35ptsga

Optimizing Epistemic Model Checking Using Conditional Independence (Extended Abstract)

Ron van der Meyden
2017 Electronic Proceedings in Theoretical Computer Science  
satisfies a formula expressed in a modal multi-agent logic of knowledge.  ...  This paper shows that conditional independence reasoning can be applied to optimize epistemic model checking, in which one verifies that a model for a number of agents operating with imperfect information  ...  Background: Epistemic Logic We begin by recalling some basic definitions from epistemic logic and epistemic model checking.  ... 
doi:10.4204/eptcs.251.29 fatcat:35uid64y4rhj5j4jqg4oowj64q

On Formal Methods for Collective Adaptive System Engineering. Scalable Approximated, Spatial Analysis Techniques. Extended Abstract

Diego Latella
2016 Electronic Proceedings in Theoretical Computer Science  
In this extended abstract a view on the role of Formal Methods in System Engineering is briefly presented.  ...  The first technique is Scalable Approximated Population DTMC Model-checking. The second one is Spatial Model-checking for Closure Spaces.  ...  It consists of an efficient procedure that, given an abstract model M of the system, decides whether M satisfies a (typically temporal, but also probabilistic) logic formula.  ... 
doi:10.4204/eptcs.217.7 fatcat:fhd24qs7zfa3zitukvh7ppgyne

Learning Explanatory Rules from Noisy Data (Extended Abstract)

Richard Evans, Edward Grefenstette
2018 Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence  
In contrast, logic programming methods such as Inductive Logic Programming offer an extremely data-efficient process by which models can be trained to reason on symbolic domains.  ...  As their size and expressivity increases, so too does the variance of the model, yielding a nearly ubiquitous overfitting problem.  ...  Introduction Inductive Logic Programming (ILP) is a collection of techniques for constructing logic programs from examples.  ... 
doi:10.24963/ijcai.2018/792 dblp:conf/ijcai/EvansG18 fatcat:f7skf5hnbjgcfbjbleid3j7qda

Effect of Anthropomorphic Glyph Design on the Accuracy of Categorization Tasks

Aditeya Pandey, Peter Bex, Michelle A. Borkin
2022 CHI Conference on Human Factors in Computing Systems Extended Abstracts  
Figure 1 : From left to right, glyph designs with an increasing level of anthropomorphic characteristics.  ...  In our study we found strong evidence that the least anthropomorphic glyph ('Pixel') was more accurate than the 'Petal,' 'Human,' and 'Face' glyphs for a probabilistic categorization task.  ...  As a result, probabilistic category learning has been extensively studied for the development and testing of formal models of learning and memory (e.g., [1, 14, 15, 25] ).  ... 
doi:10.1145/3491101.3519748 fatcat:bnghja23vjcrtoi344dupwmowm

Purely Rational Secret Sharing (Extended Abstract) [chapter]

Silvio Micali, abhi shelat
2009 Lecture Notes in Computer Science  
In particular, each player prefers best to be the only one to learn S, less to learn S along with some other players, and even less not to learn S at all.  ...  From the cryptographic perspective of the authors, traditional "solution concepts" are only partially meaningful, as they are stated from the perspective of individual players, disregarding collusion altogether  ...  For the rest of this extended abstract let us assume that the utilities are such that there is a unique bargaining solution.  ... 
doi:10.1007/978-3-642-00457-5_4 fatcat:745qwlwy65bs5g3awfghl3enri

Private information storage (extended abstract)

Rafail Ostrovsky, Victor Shoup
1997 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97  
The question of private retrieval from multiple databases was introduced in a very nice paper of Chor, Goldreich, Kushilevitz and Sudan FOCS '95, but the question whether it is possible to perform both  ...  In fact, we show a general information-theoretic reduction from reading and writing to any read-only scheme that preserves the communication complexity of the read scheme to within a poly-logarithmic factor  ...  Model and Problem statement We suppose that the composite database logically" maintains a bit vector of length n.  ... 
doi:10.1145/258533.258606 dblp:conf/stoc/OstrovskyS97 fatcat:rqudnxi7mjcufdfwnh3iatvcu4

Variable Elimination in Binary CSPs (Extended Abstract)

Martin C. Cooper, Achref El Mouelhi, Cyril Terrioux
2020 Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence  
For example, Bouveret and Lang [2008] consider simple dichotomous preferences in which a subset of items is acceptable or it isn't and this is specified by (models of) a propositional logical formula  ...  Can we apply other ideas from CS/AI to help us understand and solve fair division problems (e.g. automated reasoning methods like SAT for theorem discovery, or machine learning methods for the design of  ... 
doi:10.24963/ijcai.2020/691 dblp:conf/ijcai/Walsh20 fatcat:i4h3p6o2tvcl7iu4ah33hk2nr4

Graceful Degradation in Multi-Party Computation (Extended Abstract) [chapter]

Martin Hirt, Christoph Lucas, Ueli Maurer, Dominik Raub
2011 Lecture Notes in Computer Science  
Agreement on abort means that the adversary can possibly prevent honest parties from learning their output, even while corrupted parties learn their outputs, but then the honest parties at least reach  ...  The dishonesty of parties is typically modeled with a central adversary who corrupts parties.  ...  ., efficiency) with graceful degradation of security and corruption types (e.g. fail-corruption), as well as to consider other security models (e.g. computational security).  ... 
doi:10.1007/978-3-642-20728-0_15 fatcat:3owrpabzsbgatcfqjn4vmsuaza
« Previous Showing results 1 — 15 out of 30,076 results